Incomplete-Cholesky factorization by a matrix-partition algorithm
Conference
·
OSTI ID:6203758
Matrix-partition algorithms for solving tridiagonal systems of equations are highly adaptable to parallel processors. In this paper, a matrix-partition algorithm for generating a block-Cholesky factorization of a permuted form of a block tridiagonal system is presented. A preconditioning system based on an incomplete application of this algorithm is then described. Under certain dominance conditions, it is shown that the computations within a partition can be performed independently thus yielding a highly parallel incomplete-Cholesky factorization particularly suitable for multi-processing architectures.
- Research Organization:
- California State Univ., Hayward (USA); Lawrence Livermore National Lab., CA (USA)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 6203758
- Report Number(s):
- UCRL-88989; CONF-830116-3; ON: DE83013044
- Country of Publication:
- United States
- Language:
- English
Similar Records
Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout
A scalable parallel algorithm for sparse Cholesky factorization
Block preconditioning for the conjugate gradient method
Technical Report
·
Thu Dec 31 23:00:00 EST 2015
·
OSTI ID:1237520
A scalable parallel algorithm for sparse Cholesky factorization
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87680
Block preconditioning for the conjugate gradient method
Journal Article
·
Mon Dec 31 23:00:00 EST 1984
· SIAM J. Sci. Stat. Comput.; (United States)
·
OSTI ID:6692002