Related Experiment Video
Updated: Dec 31, 2025

Using Cholesky Decomposition to Explore Individual Differences in Longitudinal Relations between Reading Skills
Published on: September 17, 2019
Curing basis set overcompleteness with pivoted Cholesky decompositions.
1Department of Chemistry, University of Helsinki, P.O. Box 55 (A. I. Virtasen aukio 1), FI-00014 Helsinki, Finland.
A new method using pivoted Cholesky decomposition stabilizes electronic structure calculations by pruning overcomplete basis sets. This approach reduces computational cost while maintaining accuracy, especially for diffuse functions needed for weakly bound states.
Area of Science:
- Computational Chemistry
- Quantum Chemistry
- Materials Science
Background:
- Describing weakly bound electronic states is challenging using traditional atomic orbital basis sets.
- Diffuse basis functions, essential for extended states, introduce linear dependencies, leading to unstable electronic structure calculations.
Purpose of the Study:
- To develop a numerically stable method for pruning overcomplete molecular basis sets.
- To reduce the computational cost of electronic structure calculations without sacrificing accuracy.
Main Methods:
- A pivoted Cholesky decomposition of the overlap matrix is employed to identify and remove redundant basis functions.
- The method generates an optimal low-rank approximation of the original basis set.
- Implementation involves either modifying orthogonalization or creating custom atomic basis sets.
Main Results:
- The pruned basis sets allow for stable and accurate electronic structure calculations, even at the self-consistent field (SCF) level.
- Significant cost reductions were observed, with savings increasing with basis set size (9% for single-ζ, 28% for triple-ζ).
- Accuracy comparable to standard augmented basis sets was achieved.
Conclusions:
- Pivoted Cholesky decomposition offers an efficient and stable approach to basis set optimization for electronic structure calculations.
- This method is particularly beneficial for systems with diffuse functions, such as weakly bound states.
- The technique provides a practical way to achieve high accuracy with reduced computational expense.
Related Concept Videos
Gaussian Elimination: Problem Solving
Determination of Pi Terms
The theorem indicates that the...
Fundamental Theorem of Algebra
Routh-Hurwitz Criterion I
To apply the Routh-Hurwitz criterion, a Routh table is constructed. The table's rows are labeled with powers of the complex frequency variable s, starting from the...
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Synthetic Disvision of Polynomials

