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
From MaRDI portal
Publication:5117399
DOI10.1088/1361-6420/ab9c45zbMath1452.65075arXiv2003.09259OpenAlexW3102248732MaRDI QIDQ5117399
Publication date: 25 August 2020
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.09259
Ritz valueslow-rank approximationsemi-convergencediscrete ill-posed problemsmultiple singular values
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Related Items
The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision, A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization, Admissible subspaces and the subspace iteration method, Double precision is not necessary for LSQR for solving discrete linear ill-posed problems, Iterative hybrid regularization for extremely noisy full models in single particle analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inheritance of the discrete Picard condition in Krylov subspace methods
- Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
- A weighted-GCV method for Lanczos-hybrid regularization
- Iterative regularization with minimum-residual methods
- Solving or resolving inadequate and noisy tomographic systems
- The rate of convergence of conjugate gradients
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Regularization methods for large-scale problems
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- Statistical and computational inverse problems.
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
- Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
- Regularization methods for the stable solution of inverse problems
- On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
- 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
- Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank
- Robust methods in inverse theory
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A Practical Examination of Some Numerical Methods for Linear Discrete Ill-Posed Problems
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization by Truncated Total Least Squares
- Linear and Nonlinear Inverse Problems with Practical Applications
- Computational Methods for Inverse Problems
- Restoration of atmospherically blurred images by symmetric indefinite conjugate gradient techniques
- Iterative Regularization and MINRES
- The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem
- A Framework for Regularization via Operator Approximation
- Discrete Inverse Problems
- Numerical Methods in Matrix Computations
- Core Problems in Linear Algebraic Systems
- Methods of conjugate gradients for solving linear systems
- The N‐Step Iteration Procedures
- An introduction to the mathematical theory of inverse problems
