CIMGS: An Incomplete Orthogonal FactorizationPreconditioner

DOI10.1137/S1064827594268270zbMath0871.65033MaRDI QIDQ4336713

Randall Bramley, Kyle A. Gallivan, Xiaoge Wang

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

zbMATH Keywords

preconditioner; regular splitting; M-matrices; incomplete Cholesky factorization; incomplete orthogonal factorization

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65F35: Numerical computation of matrix norms, conditioning, scaling

65F25: Orthogonalization in numerical linear algebra

Related Items

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, A quasi-minimal residual variant of IDRstab using the residual smoothing technique, On \(m\)-step Hermitian and skew-Hermitian splitting preconditioning methods, Numerical study on incomplete orthogonal factorization preconditioners, Modified incomplete orthogonal factorization methods using Givens rotations, Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming, Accuracy of preconditioned CG-type methods for least squares problems., A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems, Using partial spectral information for block diagonal preconditioning of saddle-point systems, Solving large linear least squares problems with linear equality constraints, Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems, A class of incomplete orthogonal factorization methods. II: Implemetation and results, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations

Uses Software

• CIMGS