an:06290782
Zbl 1302.65081
Morikuni, Keiichi; Reichel, Lothar; Hayami, Ken
FGMRES for linear discrete ill-posed problems
EN
Appl. Numer. Math. 75, 175-187 (2014).
0168-9274
2014
j
65F10 65F08 65F22
iterative method; linear discrete ill-posed problem; subspace selection
Summary: GMRES is one of the most popular iterative methods for the solution of large linear systems of equations. However, GMRES does not always perform well when applied to the solution of linear systems of equations that arise from the discretization of linear ill-posed problems with error-contaminated data represented by the right-hand side. Such linear systems are commonly referred to as linear discrete ill-posed problems. The FGMRES method, proposed by Saad, is a generalization of GMRES that allows larger flexibility in the choice of solution subspace than GMRES. This paper explores application of FGMRES to the solution of linear discrete ill-posed problems. Numerical examples illustrate that FGMRES with a suitably chosen solution subspace may determine approximate solutions of higher quality than commonly applied iterative methods.