Breakdown-free GMRES for Singular Systems

Authors:
Lothar Reichel;Qiang Ye
Affiliations:
-;-
Venue:
SIAM Journal on Matrix Analysis and Applications
Year:
2005

Citing 0
Cited 8

Decomposition methods for large linear discrete ill-posed problems

Journal of Computational and Applied Mathematics - Special issue: Applied computational inverse problems
Arnoldi-Tikhonov regularization methods

Journal of Computational and Applied Mathematics
A variable preconditioned GCR(m) method using the GSOR method for singular and rectangular linear systems

Journal of Computational and Applied Mathematics
Cascadic multilevel methods for fast nonsymmetric blur- and noise-removal

Applied Numerical Mathematics
GMRES Methods for Least Squares Problems

SIAM Journal on Matrix Analysis and Applications
Algorithms for range restricted iterative methods for linear discrete ill-posed problems

Numerical Algorithms
Segmentation of 3d tubular structures by a PDE-Based anisotropic diffusion model

MMCS'08 Proceedings of the 7th international conference on Mathematical Methods for Curves and Surfaces
FGMRES for linear discrete ill-posed problems

Applied Numerical Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

GMRES is a popular iterative method for the solution of large linear systems of equations with a square nonsingular matrix. When the matrix is singular, GMRES may break down before an acceptable approximate solution has been determined. This paper discusses properties of GMRES solutions at breakdown and presents a modification of GMRES to overcome the breakdown.