Linear‐scaling Cholesky decomposition
Journal of Computational Chemistry2007Vol. 29(6), pp. 1004–1010
Citations Over Time
Abstract
We present linear-scaling routines for the calculation of the Cholesky decomposition of a symmetric positive-definite matrix and its inverse. As an example, we consider the inversion of the overlap matrix of DNA and amylose fragments as well as of linear alkanes, where the largest system corresponds to a 21,442 x 21,442 matrix. The efficiency and the scaling behavior are discussed and compared to standard LAPACK routines. Our Cholesky routines are publicly available on the web.
Related Papers
- → A New Modified Cholesky Factorization(1990)163 cited
- → Iterative Refinement of the Solution of a Positive Definite System of Equations(1971)44 cited
- → A modified algorithm for accurate inverse Cholesky factorization(2013)6 cited
- → A Comment on Syminv: An Algorithm for the Inversion of a Positive Definite Matrix by the Cholesky Decomposition(1974)