Parameterless stopping criteria for recursive density matrix expansions
Anastasia Kruchinina, Elias Rudberg, Emanuel H. Rubensson

TL;DR
This paper introduces a parameterless stopping criterion for recursive density matrix expansions in electronic structure calculations, enabling automatic and accurate detection of convergence without user-defined tolerances.
Contribution
The authors propose a novel convergence detection method based on convergence order estimation that eliminates the need for manually set stopping parameters.
Findings
Works well in dense and sparse matrix calculations
Effective in large-scale self-consistent field calculations
Automatically detects when numerical errors dominate
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).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
