An improved preconditioned LSQR for discrete ill-posed problems

DOI10.1016/j.matcom.2006.06.023zbMath1104.65034OpenAlexW2090414338MaRDI QIDQ853214

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

zbMATH Keywords

algorithmregularizationnumerical examplesconjugate gradient methodtwo-level preconditioninglarge ill-posed linear problemsleast squares QR (LSQR) method

Mathematics Subject Classification ID

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)

Related Items (7)

Preconditioned RRGMRES for Discrete Ill-Posed Problems ⋮ LSQR algorithm with structured preconditioner for the least squares problem in quaternionic quantum theory ⋮ An iterative method for Tikhonov regularization with a general linear regularization operator ⋮ Matrix LSQR algorithm for structured solutions to quaternionic least squares problem ⋮ Automatic stopping rule for iterative methods in discrete ill-posed problems ⋮ Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization ⋮ A modified Tikhonov regularization method

Uses Software

• irbleigs
• Regularization tools
• UTV

Cites Work

• Unnamed Item
• Unnamed Item
• Subspace preconditioned LSQR for discrete ill-posed problems
• Two-level preconditioners for regularized inverse problems. I: Theory
• Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
• Near-Optimal Parameters for Tikhonov and Other Regularization Methods
• Ten Lectures on Wavelets
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• The Discrete Cosine Transform
• Algorithm 827

This page was built for publication: An improved preconditioned LSQR for discrete ill-posed problems