Some results on the regularization of LSQR for large-scale discrete ill-posed problems
From MaRDI portal
Publication:1708059
DOI10.1007/s11425-015-0568-4zbMath1453.65080arXiv1503.01864OpenAlexW2964223338MaRDI QIDQ1708059
Publication date: 4 April 2018
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01864
Ill-posedness and regularization problems in numerical linear algebra (65F22) Eigenvalues, singular values, and eigenvectors (15A18) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)
Related Items
Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs, Weighted conjugate gradient-type methods for solving quadrature discretization of Fredholm integral equations of the first kind, 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, Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems, Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction, The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides, Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems, An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces, The low rank approximations and Ritz values in LSQR for linear discrete ill-posed problem, 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
- A GCV based Arnoldi-Tikhonov regularization method
- Comparing parameter choice methods for regularization of ill-posed problems
- Algorithms for range restricted iterative methods for linear discrete ill-posed problems
- A weighted-GCV method for Lanczos-hybrid regularization
- Iterative regularization with minimum-residual methods
- Arnoldi-Tikhonov regularization methods
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- Tikhonov regularization of large linear problems
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
- GMRES, L-curves, and discrete ill-posed problems
- \(L\)-curve curvature bounds via Lanczos bidiagonalization
- Old and new parameter choice rules for discrete ill-posed problems
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- On Krylov projection methods and Tikhonov regularization
- Multi-parameter Arnoldi-Tikhonov 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
- Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
- Matrix Algorithms
- Ill-conditioning of the truncated singular value decomposition, Tikhonov regularization and their applications to numerical partial differential equations
- The Exact Condition Number of the Truncated Singular Value Solution of a Linear Ill-Posed Problem
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Rank-Deficient and Discrete Ill-Posed Problems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Computational Methods for Inverse Problems
- Discrete Inverse Problems
- Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization
