A class of incomplete orthogonal factorization methods. II: Implemetation and results
From MaRDI portal
(Redirected from Publication:2568630)
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
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 51442 (Why is no real title available?)
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- 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
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)
