GMRES is one of the most popular iterative methods for the solution of large linear systems of equations that arise from the discretization of linear well-posed problems, such as boundary value problems for elliptic partial differential equations. The method is also applied to the iterative solution of linear systems of equations that are obtained by discretizing linear ill-posed problems, such as many inverse problems. However, GMRES does not always perform well when applied to the latter kind of problems. This paper seeks to shed some light on reasons for the poor performance of GMRES in certain situations, and discusses some remedies based on specific kinds of preconditioning. The standard implementation of GMRES is based on the Arnoldi process, which also can be used to define a solution subspace for Tikhonov or TSVD regularization, giving rise to the Arnoldi–Tikhonov and Arnoldi-TSVD methods, respectively. The performance of the GMRES, the Arnoldi–Tikhonov, and the Arnoldi-TSVD methods is discussed. Numerical examples illustrate properties of these methods.

Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems / Gazzola, Silvia; Noschese, Silvia; Novati, Paolo; Reichel, Lothar. - In: APPLIED NUMERICAL MATHEMATICS. - ISSN 0168-9274. - 142:(2019), pp. 102-121. [10.1016/j.apnum.2019.02.010]

Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems

Noschese, Silvia;
2019

Abstract

GMRES is one of the most popular iterative methods for the solution of large linear systems of equations that arise from the discretization of linear well-posed problems, such as boundary value problems for elliptic partial differential equations. The method is also applied to the iterative solution of linear systems of equations that are obtained by discretizing linear ill-posed problems, such as many inverse problems. However, GMRES does not always perform well when applied to the latter kind of problems. This paper seeks to shed some light on reasons for the poor performance of GMRES in certain situations, and discusses some remedies based on specific kinds of preconditioning. The standard implementation of GMRES is based on the Arnoldi process, which also can be used to define a solution subspace for Tikhonov or TSVD regularization, giving rise to the Arnoldi–Tikhonov and Arnoldi-TSVD methods, respectively. The performance of the GMRES, the Arnoldi–Tikhonov, and the Arnoldi-TSVD methods is discussed. Numerical examples illustrate properties of these methods.
2019
Arnoldi process, GMRES, linear discrete ill-posed problem, Tikhonov regularization, truncated iteration, truncated singular value decomposition, numerical analysis, computational mathematics, applied mathematics
01 Pubblicazione su rivista::01a Articolo in rivista
Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems / Gazzola, Silvia; Noschese, Silvia; Novati, Paolo; Reichel, Lothar. - In: APPLIED NUMERICAL MATHEMATICS. - ISSN 0168-9274. - 142:(2019), pp. 102-121. [10.1016/j.apnum.2019.02.010]
File allegati a questo prodotto
File Dimensione Formato  
Gazzola_Arnoldi-decomposition_2019.pdf

accesso aperto

Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 594.06 kB
Formato Adobe PDF
594.06 kB Adobe PDF Visualizza/Apri PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1281333
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 10
social impact