Résumé
| langue | Anglais |
|---|---|
| Pages | 969-986 |
| Nombre de pages | 18 |
| journal | SIAM Journal on Matrix Analysis and Applications |
| Volume | 32 |
| Numéro | 3 |
| Les DOIs | |
| état | Publié - 1 janv. 2011 |
Empreinte digitale
Citer ceci
}
Range-space variants and inexact matrix-vector products in Krylov solvers for linear systems arising from inverse problems. / Gratton, S.; Toint, Philippe; Tshimanga Ilunga, J.
Dans: SIAM Journal on Matrix Analysis and Applications, Vol 32, Numéro 3, 01.01.2011, p. 969-986.Résultats de recherche: Contribution à un journal/une revue › Article
TY - JOUR
T1 - Range-space variants and inexact matrix-vector products in Krylov solvers for linear systems arising from inverse problems
AU - Gratton,S.
AU - Toint,Philippe
AU - Tshimanga Ilunga,J.
N1 - Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011/1/1
Y1 - 2011/1/1
N2 - The objects of this paper are to introduce range-space variants of standard Krylov iterative solvers for unsymmetric and symmetric linear systems and to discuss how inexact matrix-vector products may be used in this context. The new range-space variants are characterized by possibly much lower storage and computational costs than their full-space counterparts, which is crucial in data assimilation applications and other inverse problems. However, this gain is achieved without sacrificing the inherent monotonicity properties of the original algorithms, which are of paramount importance in data assimilation applications. The use of inexact matrix-vector products is shown to further reduce computational cost in a controlled manner. Formal error bounds are derived on the size of the residuals obtained under two different accuracy models, and it is shown why a model controlling forward error on the product result is often preferable to one controlling backward error on the operator. Simple numerical examples finally illustrate the developed concepts and methods.
AB - The objects of this paper are to introduce range-space variants of standard Krylov iterative solvers for unsymmetric and symmetric linear systems and to discuss how inexact matrix-vector products may be used in this context. The new range-space variants are characterized by possibly much lower storage and computational costs than their full-space counterparts, which is crucial in data assimilation applications and other inverse problems. However, this gain is achieved without sacrificing the inherent monotonicity properties of the original algorithms, which are of paramount importance in data assimilation applications. The use of inexact matrix-vector products is shown to further reduce computational cost in a controlled manner. Formal error bounds are derived on the size of the residuals obtained under two different accuracy models, and it is shown why a model controlling forward error on the product result is often preferable to one controlling backward error on the operator. Simple numerical examples finally illustrate the developed concepts and methods.
UR - http://www.scopus.com/inward/record.url?scp=80054030427&partnerID=8YFLogxK
U2 - 10.1137/090780493
DO - 10.1137/090780493
M3 - Article
VL - 32
SP - 969
EP - 986
JO - SIAM Journal on Matrix Analysis and Applications
T2 - SIAM Journal on Matrix Analysis and Applications
JF - SIAM Journal on Matrix Analysis and Applications
SN - 0895-4798
IS - 3
ER -