The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem
DOI10.1088/1361-6420/ab6f42OpenAlexW2899557605MaRDI QIDQ5000587
Publication date: 14 July 2021
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03454
Ritz valuessemi-convergenceGolub-Kahan bidiagonalizationdiscrete ill-posedLSQR iteratenear best rank \(k\) approximationTSVD solution
Numerical linear algebra (65Fxx) Numerical analysis (65-XX) Miscellaneous topics in partial differential equations (35Rxx) Numerical methods for integral equations, integral transforms (65Rxx) Numerical analysis in abstract spaces (65Jxx)
Related Items (3)
Uses Software
Cites Work
- 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 properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- 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
- On Krylov projection methods and Tikhonov regularization
- 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
- Matrix Algorithms
- Numerical Methods for Inverse Problems
- Inverse Problems
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Rank-Deficient and Discrete Ill-Posed Problems
- Linear and Nonlinear Inverse Problems with Practical Applications
- Test Matrices for Regularization Methods
- Computational Methods for Inverse Problems
- Discrete Inverse Problems
- Numerical Methods in Matrix Computations
- An introduction to the mathematical theory of inverse problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem