Block preconditioning for the conjugate gradient method
Journal Article
·
· SIAM J. Sci. Stat. Comput.; (United States)
Block preconditioning for the conjugate gradient method are investigated for solving positive definite block tridiagonal systems of linear equations arising from discretization of boundary value problems for elliptic partial differential equations. The preconditioning rest on the use of sparse approximate matrix inverses to generate incomplete block Cholesky factorizations. Carrying out of the factorizations can be guaranteed under suitable conditions. Numerical experiments on test problems for two dimensions indicate that a particularly attractive preconditioning, which uses special properties of tridiagonal matrix inverses, can be computationally more efficient for the same computer storage than other preconditionings, including the popular point incomplete Cholesky factorization. 22 references, 6 figures, 12 tables.
- Research Organization:
- Univ. of California, Berkeley
- DOE Contract Number:
- AC03-76SF00098; AC03-76SF00515
- OSTI ID:
- 6692002
- Journal Information:
- SIAM J. Sci. Stat. Comput.; (United States), Journal Name: SIAM J. Sci. Stat. Comput.; (United States) Vol. 6:1; ISSN SIJCD
- Country of Publication:
- United States
- Language:
- English
Similar Records
Preconditioned polynomial iterative acceleration methods for block tridiagonal systems
Incomplete block factorization preconditioning for indefinite elliptic problems
Polynomial preconditioning for conjugate gradient methods
Conference
·
Mon Sep 01 00:00:00 EDT 1986
·
OSTI ID:7181980
Incomplete block factorization preconditioning for indefinite elliptic problems
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:433337
Polynomial preconditioning for conjugate gradient methods
Technical Report
·
Mon Nov 30 23:00:00 EST 1987
·
OSTI ID:5576336