Computing projections with LSQR
From MaRDI portal
Publication:678216
DOI10.1007/BF02510175zbMath0870.65032WikidataQ59674849 ScholiaQ59674849MaRDI QIDQ678216
Publication date: 17 September 1997
Published in: BIT (Search for Journal in Brave)
Related Items
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
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
