A class of incomplete orthogonal factorization methods. II: Implemetation and results

DOI10.1007/s10543-005-2642-zzbMath1080.65028OpenAlexW2026041872MaRDI QIDQ2568630

A. T. Papadopoulos, Andrew J. Wathen, Iain S. Duff

Publication date: 18 October 2005

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-005-2642-z

zbMATH Keywords

numerical examplespreconditioningiterative methodssparse linear systemsGivens rotationsincomplete orthogonal factorizationssparse least-squares

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)

Related Items (8)

A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Numerical study on incomplete orthogonal factorization preconditioners ⋮ Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations ⋮ Modified incomplete orthogonal factorization methods using Givens rotations ⋮ Solving large linear least squares problems with linear equality constraints ⋮ On an iterative method for solving the least squares problem of rank-deficient systems

Uses Software

• HSL
• LSQR
• MatrixMarket
• SparseMatrix
• SPARSKIT
• CIMGS
• CRAIG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving large and sparse linear least-squares problems by conjugate gradient algorithms
• Preconditioning techniques for nonsymmetric and indefinite linear systems
• Solution of sparse linear least squares problems using Givens rotations
• Preconditioners for least squares problems by LU factorization
• On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
• Preconditioning Highly Indefinite and Nonsymmetric Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
• CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
• Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
• A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• Incomplete Methods for Solving $A^T Ax = b$
• A class of incomplete orthogonal factorization methods. I: Methods and theories

This page was built for publication: A class of incomplete orthogonal factorization methods. II: Implemetation and results