A class of incomplete orthogonal factorization methods. II: Implemetation and results
DOI10.1007/S10543-005-2642-ZzbMATH Open1080.65028OpenAlexW2026041872MaRDI QIDQ2568630FDOQ2568630
Authors: A. T. Papadopoulos, A. 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
Recommendations
- A class of incomplete orthogonal factorization methods. I: Methods and theories
- Numerical study on incomplete orthogonal factorization preconditioners
- scientific article; zbMATH DE number 766250
- Incomplete factorization methods for systems with sparse matrices
- An efficient implementation for SSOR and incomplete factorization preconditionings
numerical examplespreconditioningiterative methodssparse linear systemsGivens rotationsincomplete orthogonal factorizationssparse least-squares
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
- A class of incomplete orthogonal factorization methods. I: Methods and theories
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Incomplete Methods for Solving $A^T Ax = b$
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems
- Preconditioners for least squares problems by LU factorization
- Preconditioning highly indefinite and nonsymmetric matrices
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Solution of sparse linear least squares problems using Givens rotations
- Solving large and sparse linear least-squares problems by conjugate gradient algorithms
- Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
Cited In (10)
- A class of incomplete orthogonal factorization methods. I: Methods and theories
- Numerical study on incomplete orthogonal factorization preconditioners
- Modified incomplete orthogonal factorization methods using Givens rotations
- Preconditioners for Krylov subspace methods: An overview
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- On an iterative method for solving the least squares problem of rank-deficient systems
- Solving large linear least squares problems with linear equality constraints
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Incomplete factorization methods for systems with sparse matrices
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
Uses Software
This page was built for publication: A class of incomplete orthogonal factorization methods. II: Implemetation and results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568630)
