Jump to content

Talk:Conjugate residual method

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bryanrutherford0 (talk | contribs) at 13:28, 12 November 2014 (Adding class, importance & field to maths rating template). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Range of matrices applicable

The article claims that the CRM be applicable to any non-singular hermitian system. This is wrong, and no source for that wrong claim is available. Compare as a simple counter example, in Matlab notation:

A = [ 1 0 ; 0 -1 ]; b = [1 1]; x_0 = [0 0]

Then the initial residual is r_0 = [1 1]. However, 0 = r_0 * A * r_0', as you please check by yourself. So the initial alpha is 0, and one sees that the iteration keeps stuck at x_i = [ 0, 0 ], which is not the solution. Even worse in the complex valued case. Take

A = [ 1 0 ; 0 i ]; b = [1 1]; x_0 = [0 0]

Then p_0 = r_0 = b, while p_0 * A * A * p_0' = 0, as you please check by yourself, and the algorithm has a fatal break down. Hence the article makes a wrong claim. \qed --212.201.70.54 (talk) 16:55, 6 January 2013 (UTC)[reply]