Parameterless stopping criteria for recursive density matrix expansions

Abstract

Parameterless stopping criteria for recursive polynomial expansions to construct the density matrix in electronic structure calculations are proposed. Based on convergence order estimation the new stopping criteria automatically and accurately detect when the calculation is dominated by numerical errors and continued iteration does not improve the result. Difficulties in selecting a stopping tolerance and appropriately balancing it in relation to parameters controlling the numerical accuracy are avoided. Thus, our parameterless stopping criteria stands in contrast to the standard approach to stop as soon as some error measure goes below a user-defined parameter or tolerance. We demonstrate that the stopping criteria work well both in dense and sparse matrix calculations and in large-scale self-consistent field calculations with the quantum chemistry program Ergo (www.ergoscf.org).

References in corpus (1)

• Non-monotonic recursive polynomial expansions for linear scaling calculation of the density matrix

Cited by in corpus (8)

• Mixed Precision Fermi-Operator Expansion on Tensor Cores From a Machine Learning Perspective
• Assessment of localized and randomized algorithms for electronic structure
• Graph-based Quantum Response Theory and Shadow Born-Oppenheimer Molecular Dynamics
• On-the-fly computation of frontal orbitals in density matrix expansions
• Efficient computation of the density matrix with error control on distributed computer systems
• Sparse approximate matrix-matrix multiplication for density matrix purification with error control
• Parallelization and scalability analysis of inverse factorization using the Chunks and Tasks programming model
• Multiple eigenvectors around the homo-lumo gap as a cheap by-product in linear scaling electronic structure calculations