Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
DOI10.1016/j.cam.2008.05.052zbMath1160.65313OpenAlexW2072708752MaRDI QIDQ1008678
Publication date: 30 March 2009
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2008.05.052
comparison of methodsnumerical experimentspreconditionergeneralized minimal residual (GMRES) methodlarge sparse matricesleast-squares problemsconjugate gradient least-squares methodincomplete Givens orthogonalization methods
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A necessary and sufficient convergence condition of orthomin(k) methods for least squares problem with weight
- A preconditioned Krylov subspace method for the solution of least squares problems in inverse scattering
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems
- The university of Florida sparse matrix collection
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Numerical Optimization
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- Methods of conjugate gradients for solving linear systems
- A class of incomplete orthogonal factorization methods. I: Methods and theories