Simple stopping criteria for the LSQR method applied to discrete ill-posed problems

DOI10.1007/s11075-019-00852-1zbMath1462.65040OpenAlexW3001342506WikidataQ126301558 ScholiaQ126301558MaRDI QIDQ780395

Wei-Hong Zhang, Hassane Sadok, Lothar Reichel

Publication date: 15 July 2020

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-019-00852-1

zbMATH Keywords

stopping criteriondiscrete ill-posed problemLSQRGolub-Kahan bidiagonalizationCraig's method

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)

Related Items (1)

Double precision is not necessary for LSQR for solving discrete linear ill-posed problems

Uses Software

• LSQR
• Regularization tools
• UTV
• ErresTools
• cosereg
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Vector extrapolation applied to truncated singular value decomposition and truncated iteration
• Comparing parameter choice methods for regularization of ill-posed problems
• A new \(L\)-curve for ill-posed problems
• Error estimates for linear systems with applications to regularization
• Error estimates for the regularization of least squares problems
• Extrapolation techniques for ill-conditioned linear systems
• Parameter determination for Tikhonov regularization problems in general form
• GCV for Tikhonov regularization by partial SVD
• Solution of sparse rectangular systems using LSQR and Craig
• Old and new parameter choice rules for discrete ill-posed problems
• Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
• Regularization tools version \(4.0\) for matlab \(7.3\)
• Iterative methods for ill-posed problems and semiconvergent sequences
• Regularization parameter determination for discrete ill-posed problems
• Improvement of the resolution of an instrument by numerical solution of an integral equation
• The Lanczos and conjugate gradient algorithms in finite precision arithmetic
• The quasi-optimality criterion for classical inverse problems
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• A Regularization Parameter in Discrete Ill-Posed Problems
• Discrete Inverse Problems
• Bidiagonalization of Matrices and Solution of Linear Equations
• The numerical solution of non-singular linear integral equations

This page was built for publication: Simple stopping criteria for the LSQR method applied to discrete ill-posed problems