Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
Citations Over TimeTop 10% of 1993 papers
Abstract
As with many other linear algebra algorithms, devising a portable implementation of sparse Cholesky factorization that performs well on the broad range of computer architectures currently available is a formidable challenge. Even after limiting the attention to machines with only one processor, as has been done in this paper, there are still several interesting issues to consider. For dense matrices, it is well known that block factorization algorithms are the best means of achieving this goal. This approach is taken for sparse factorization as well. This paper has two primary goals. First, two sparse Cholesky factorization algorithms, the multifrontal method and a blocked left-looking sparse Cholesky method, are examined in a systematic and consistent fashion, both to illustrate the strengths of the blocking techniques in general and to obtain a fair evaluation of the two approaches, Second, the impact of various implementation techniques on time and storage efficiency is assessed, paying particularly close attention to the work-storage requirement of the two methods and their variants.
Related Papers
- → CIMGS: An Incomplete Orthogonal FactorizationPreconditioner(1997)50 cited
- → An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme(1987)15 cited
- → Modified Incomplete Cholesky Preconditioners for 2D Resistivity Modeling(2005)3 cited
- Sparse approximate inverse preconditioners based on a revised Cholesky factorization(2011)
- Numerical Stability of Cholesky Factorization in Interior Point Methods for Linear Programming(1999)