Premium
Preconditioning CGNE iteration for inverse problems
Author(s) -
Egger H.
Publication year - 2007
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.522
Subject(s) - mathematics , conjugate gradient method , inverse problem , regularization (linguistics) , inverse , convergence (economics) , iterative method , mathematical optimization , mathematical analysis , computer science , geometry , artificial intelligence , economics , economic growth
The conjugate gradient method applied to the normal equations ( CGNE ) is known as efficient method for the solution of non‐symmetric linear equations. By stopping the iteration according to a discrepancy principle, CGNE can be turned into a regularization method, and thus can be applied to the solution of inverse, in particular, ill‐posed problems. We show that CGNE for inverse problems can be further accelerated by preconditioning in Hilbert scales, derive (optimal) convergence rates with respect to data noise, and give tight bounds on the iteration numbers. The theoretical results are illustrated by numerical tests. Copyright © 2007 John Wiley & Sons, Ltd.