Computing projections with LSQR

DOI10.1007/BF02510175zbMath0870.65032WikidataQ59674849 ScholiaQ59674849MaRDI QIDQ678216

Michael A. Saunders

Publication date: 17 September 1997

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

regularizationLSQRGolub-Kahan bidiagonalizationsparse least squares problems

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (6)

The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data ⋮ SPMR: A Family of Saddle-Point Minimum Residual Solvers ⋮ Noise representation in residuals of LSQR, LSMR, and CRAIG regularization ⋮ Two projection methods for regularized total least squares approximation ⋮ Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization ⋮ Analysis of approximate inverses in tomography. II: Iterative inverses

Uses Software

• LSQR
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Solution of sparse rectangular systems using LSQR and Craig
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Estimating the Attainable Accuracy of Recursively Computed Residual Methods
• Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• Bidiagonalization of Matrices and Solution of Linear Equations
• Methods of conjugate gradients for solving linear systems
• The N‐Step Iteration Procedures

This page was built for publication: Computing projections with LSQR