Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs

DOI10.1007/s11075-019-00865-wzbMath1455.65062arXiv1812.04762OpenAlexW3008416987MaRDI QIDQ827077

Zhongxiao Jia

Publication date: 6 January 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.04762

zbMATH Keywords

ill-posed problemsKrylov methodssemi-convergenceregularized solutionlow rank approximations

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22) Eigenvalues, singular values, and eigenvectors (15A18) Iterative numerical methods for linear systems (65F10) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items (4)

The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision ⋮ GMRES methods for tomographic reconstruction with an unmatched back projector ⋮ Regularization properties of LSQR for linear discrete ill-posed problems in the multiple singular value case and best, near best and general low rank approximations ⋮ The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem

Uses Software

• LSQR
• Regularization tools
• RestoreTools
• UTV
• AIR tools
• LSMR
• IR Tools
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• Inheritance of the discrete Picard condition in Krylov subspace methods
• The instability of some gradient methods for ill-posed problems
• The discrete Picard condition for discrete ill-posed problems
• Regularization methods for large-scale problems
• Some results on the regularization of LSQR for large-scale discrete ill-posed problems
• Statistical and computational inverse problems.
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
• Regularization methods for the stable solution of inverse problems
• Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
• AIR tools II: algebraic iterative reconstruction methods, improved implementation
• IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
• AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
• Regularization tools version \(4.0\) for matlab \(7.3\)
• The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
• The Mathematics of Computerized Tomography
• Numerical Methods for Inverse Problems
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization
• Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
• Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Solution of Sparse Indefinite Systems of Linear Equations
• A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
• Rank-Deficient and Discrete Ill-Posed Problems
• Computational Methods for Inverse Problems
• Discrete Inverse Problems
• Numerical Methods in Matrix Computations
• The Lanczos and Conjugate Gradient Algorithms
• Methods of conjugate gradients for solving linear systems
• The N‐Step Iteration Procedures
• An introduction to the mathematical theory of inverse problems

This page was built for publication: Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs