An improved preconditioned LSQR for discrete ill-posed problems
DOI10.1016/J.MATCOM.2006.06.023zbMATH Open1104.65034OpenAlexW2090414338MaRDI QIDQ853214FDOQ853214
Authors: Angelika Bunse-Gerstner, Valia Guerra Ones, Humberto Madrid De La Vega 
Publication date: 15 November 2006
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2006.06.023
Recommendations
- Subspace preconditioned LSQR for discrete ill-posed problems
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- A preconditioned Krylov subspace method for the solution of least squares problems in inverse scattering
- scientific article; zbMATH DE number 409755
- Iterated preconditioned LSQR method for inverse problems on unstructured grids
regularizationnumerical examplesalgorithmconjugate gradient methodtwo-level preconditioninglarge ill-posed linear problemsleast squares QR (LSQR) method
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Algorithm 827
- Ten Lectures on Wavelets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Choosing regularization parameters in iterative methods for ill-posed problems
- The Discrete Cosine Transform
- Near-optimal parameters for Tikhonov and other regularization methods
- Subspace preconditioned LSQR for discrete ill-posed problems
- Two-level preconditioners for regularized inverse problems. I: Theory
Cited In (11)
- LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory
- Theoretical and numerical aspects of a non-stationary preconditioned iterative method for linear discrete ill-posed problems
- Subspace preconditioned LSQR for discrete ill-posed problems
- A modified Tikhonov regularization method
- An iterative method for Tikhonov regularization with a general linear regularization operator
- Efficient solution of parameter identification problems with $H^1$ regularization
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
- Preconditioned RRGMRES for discrete ill-posed problems
- Matrix LSQR algorithm for structured solutions to quaternionic least squares problem
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
Uses Software
This page was built for publication: An improved preconditioned LSQR for discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853214)
