×

zbMATH — the first resource for mathematics

Block sparse Cholesky algorithms on advanced uniprocessor computers. (English) Zbl 0785.65015
Two block sparse Cholesky factorization algorithms for linear systems are presented. Performance results of various sparse Cholesky factorization algorithms are given. One goal of this paper is to identify the “best” sequential sparse Cholesky factorization method.

MSC:
65F05 Direct numerical methods for linear systems and matrix inversion
65F50 Computational methods for sparse matrices
Software:
LAPACK
PDF BibTeX XML Cite
Full Text: DOI