CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
DOI10.1137/S1064827594268270zbMATH Open0871.65033OpenAlexW2078637543MaRDI QIDQ4336713FDOQ4336713
Authors: Xiaoge Wang, K. A. Gallivan, Randall Bramley 
Publication date: 26 August 1997
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1064827594268270
Recommendations
- Numerical study on incomplete orthogonal factorization preconditioners
- The preconditioned conjugate gradient method with incomplete factorization preconditioners
- An efficient implementation for SSOR and incomplete factorization preconditionings
- scientific article; zbMATH DE number 434785
- On Vectorizing Incomplete Factorization and SSOR Preconditioners
- A scalable parallel algorithm for incomplete factor preconditioning
- A multilevel block incomplete factorization preconditioning
- Multisplitting Preconditioners Based on Incomplete Choleski Factorizations
- Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
- Preconditioned CG methods for sparse matrices on massively parallel machines
preconditionerM-matricesincomplete Cholesky factorizationregular splittingincomplete orthogonal factorization
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25)
Cited In (14)
- A quasi-minimal residual variant of IDRstab using the residual smoothing technique
- Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems
- Accuracy of preconditioned CG-type methods for least squares problems.
- Numerical study on incomplete orthogonal factorization preconditioners
- Modified incomplete orthogonal factorization methods using Givens rotations
- Using partial spectral information for block diagonal preconditioning of saddle-point systems
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
- Preconditioners for Krylov subspace methods: An overview
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- A class of incomplete orthogonal factorization methods. II: Implemetation and results
- Solving large linear least squares problems with linear equality constraints
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- On \(m\)-step Hermitian and skew-Hermitian splitting preconditioning methods
Uses Software
This page was built for publication: CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336713)
