An augmented LSQR method
From MaRDI portal
Publication:372851
DOI10.1007/s11075-012-9665-8zbMath1273.65059OpenAlexW2055093867MaRDI QIDQ372851
James Baglama, Daniel J. Richmond, Lothar Reichel
Publication date: 21 October 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9665-8
preconditionaugmentationiterative methodleast-squares approximationKrylov subspaceLSQRpartial singular value decompositionlarge-scale computation
Related Items (9)
A Hybrid LSMR Algorithm for Large-Scale Tikhonov Regularization ⋮ A survey of subspace recycling iterative methods ⋮ Deflation for the Off-Diagonal Block in Symmetric Saddle Point Systems ⋮ Hybrid Projection Methods with Recycling for Inverse Problems ⋮ Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction ⋮ Accurate and fast matrix factorization for low-rank learning. ⋮ Testing Matrix Function Algorithms Using Identities ⋮ Hybrid Projection Methods with Recycling for Inverse Problems ⋮ Convergence analysis of LSQR for compact operator equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some properties of LSQR for large sparse linear least squares problems
- Computing interior eigenvalues of large matrices
- Restarted block Lanczos bidiagonalization methods
- Preconditioners for least squares problems by LU factorization
- Computing smallest singular triplets with implicitly restarted Lanczos bidiagonalization
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts
- Harmonic and refined extraction methods for the singular value problem, with applications in least squares problems
- GMRES Methods for Least Squares Problems
- A Refined Harmonic Lanczos Bidiagonalization Method and an Implicitly Restarted Algorithm for Computing the Smallest Singular Triplets of Large Matrices
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- A generalized LSQR algorithm
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition
- Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- GMRES with Deflated Restarting
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Restarted GMRES Method Augmented with Eigenvectors
- Bidiagonalization of Matrices and Solution of Linear Equations
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
This page was built for publication: An augmented LSQR method
