GMRES on singular systems revisited

09/01/2020 ∙ by Ken Hayami, et al. ∙ 0

In [Hayami K, Sugihara M. Numer Linear Algebra Appl. 2011; 18:449–469], the authors analyzed the convergence behaviour of the Generalized Minimal Residual (GMRES) method for the least squares problem min_ x∈ R^n b - A x_2^2, where A ∈ R^n × n may be singular and b∈ R^n, by decomposing the algorithm into the range R(A) and its orthogonal complement R(A)^⊥ components. However, we found that the proof of the fact that GMRES gives a least squares solution if R(A) = R(A^ T ) was not complete. In this paper, we will give a complete proof.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.