Invertible smoothing preconditioners for linear discrete ill-posed problems

Authors:
D. Calvetti;L. Reichel;A. Shuibi
Affiliations:
Department of Mathematics, Case Western Reserve University, Cleveland, OH;Department of Mathematical Sciences, Kent State University, Kent, OH;Department of Mathematical Sciences, DePaul University, Chicago, IL
Venue:
Applied Numerical Mathematics - 6th IMACS International symposium on iterative methods in scientific computing
Year:
2005

Citing 5
Cited 3

GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
Computational methods for integral equations

Computational methods for integral equations
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion

Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

ACM Transactions on Mathematical Software (TOMS)
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems

ACM Transactions on Mathematical Software (TOMS)

Preconditioned iterative methods for linear discrete ill-posed problems from a Bayesian inversion perspective

Journal of Computational and Applied Mathematics - Special issue: Applied computational inverse problems
Greedy Tikhonov regularization for large linear ill-posed problems

International Journal of Computer Mathematics - Fast Iterative and Preconditioning Methods for Linear and Non-Linear Systems
Arnoldi-Tikhonov regularization methods

Journal of Computational and Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The solution of large linear discrete ill-posed problems by iterative methods has recently received considerable attention. This paper presents invertible smoothing preconditioners which are well suited for use with the GMRES, RRGMRES and LSQR methods.