Title
Iterative Regularization and MINRES
Abstract
In this paper we present three theorems which give insight into the regularizing properties of MINRES. While our theory does not completely characterize the regularizing behavior of the algorithm, it provides a partial explanation of the observed behavior of the method. Unlike traditional attempts to explain the regularizing properties of Krylov subspace methods, our approach focuses on convergence properties of the residual rather than on convergence analysis of the harmonic Ritz values. The import of our analysis is illustrated by two examples. In particular, our theoretical and numerical results support the following important observation: in some circumstances the dimension of the optimal Krylov subspace can be much smaller than the number of the components of the truncated spectral solution that must be computed to attain comparable accuracy.
Year
DOI
Venue
2000
10.1137/S0895479898348623
SIAM Journal on Matrix Analysis and Applications
Keywords
Field
DocType
regularization
Convergence (routing),Krylov subspace,Residual,Mathematical optimization,Generalized minimal residual method,Mathematical analysis,Harmonic,Regularization (mathematics),Mathematics
Journal
Volume
Issue
ISSN
21
2
0895-4798
Citations 
PageRank 
References 
7
1.86
0
Authors
2
Name
Order
Citations
PageRank
Misha E. Kilmer1416.13
SIAM J. MATRIX2207.35