CIMGS: An Incomplete Orthogonal Factorization Preconditioner

Authors:
Xiaoge Wang;Kyle A. Gallivan;Randall Bramley
Affiliations:
-;-;-
Venue:
SIAM Journal on Scientific Computing
Year:
1997

Citing 0
Cited 5

Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming

Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems

The Korean Journal of Computational & Applied Mathematics
Numerical study on incomplete orthogonal factorization preconditioners

Journal of Computational and Applied Mathematics
Modified incomplete orthogonal factorization methods using Givens rotations

Computing
GMRES Methods for Least Squares Problems

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram--Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both theoretically and empirically, existing (in exact arithmetic) for any full rank matrix. Numerically it is more robust than an incomplete Cholesky factorization preconditioner (IC) and a complete Cholesky factorization of the normal equations. Theoretical results show that the CIMGS factorization has better backward error properties than complete Cholesky factorization. For symmetric positive definite M-matrices, CIMGS induces a regular splitting and better estimates the complete Cholesky factor as the set of dropped positions gets smaller. CIMGS lies between complete Cholesky factorization and incomplete Cholesky factorization in its approximation properties. These theoretical properties usually hold numerically, even when the matrix is not an M-matrix. When the drop set satisfies a mild and easily verified (or enforced) property, the upper triangular factor CIMGS generates is the same as that generated by incomplete Cholesky factorization. This allows the existence of the IC factorization to be guaranteed, based solely on the target sparsity pattern.