We present a simple, broadly applicable method for determining the numerical properties of quantum chemistry algorithms. The method deliberately introduces random numerical noise into computations, which is of the same order of magnitude as the floating point precision. Accordingly, repeated runs of an algorithm give slightly different results, which can be analyzed statistically to obtain precise estimates of its numerical stability. This noise is produced by automatic code injection into regular compiler output, so that no substantial programming effort is required, only a recompilation of the affected program sections. The method is applied to investigate: (i) the numerical stability of the three-center Obara-Saika integral evaluation scheme for high angular momenta, (ii) if coupled cluster perturbative triples can be evaluated with single precision arithmetic, (iii) how to implement the density fitting approximation in Moller-Plesset perturbation theory (MP2) most accurately, and (iv) which parts of density fitted MP2 can be safely evaluated with single precision arithmetic. In the integral case, we find a numerical instability in an equation that is used in almost all integral programs. Due to the results of (ii) and (iv), we conjecture that single precision arithmetic can be applied whenever a calculation is done in an orthogonal basis set and excessively long linear sums are avoided.
%0 Journal Article
%1 publ9350507
%A Knizia, Gerald
%A Li, Wenbin
%A Simon, Sven
%A Werner, Hans Joachim
%D 2011
%J J. Chem. Theory Comput.
%K chemie imported werner from:alexanderdenzel theoretische stuttgart theochem
%N 8
%P 2387–2398
%R 10.1021/ct200239p
%T Determining the numerical stability of quantum chemistry algorithms
%U http://dx.doi.org/10.1021/ct200239p
%V 7
%X We present a simple, broadly applicable method for determining the numerical properties of quantum chemistry algorithms. The method deliberately introduces random numerical noise into computations, which is of the same order of magnitude as the floating point precision. Accordingly, repeated runs of an algorithm give slightly different results, which can be analyzed statistically to obtain precise estimates of its numerical stability. This noise is produced by automatic code injection into regular compiler output, so that no substantial programming effort is required, only a recompilation of the affected program sections. The method is applied to investigate: (i) the numerical stability of the three-center Obara-Saika integral evaluation scheme for high angular momenta, (ii) if coupled cluster perturbative triples can be evaluated with single precision arithmetic, (iii) how to implement the density fitting approximation in Moller-Plesset perturbation theory (MP2) most accurately, and (iv) which parts of density fitted MP2 can be safely evaluated with single precision arithmetic. In the integral case, we find a numerical instability in an equation that is used in almost all integral programs. Due to the results of (ii) and (iv), we conjecture that single precision arithmetic can be applied whenever a calculation is done in an orthogonal basis set and excessively long linear sums are avoided.
@article{publ9350507,
abstract = {We present a simple, broadly applicable method for determining the numerical properties of quantum chemistry algorithms. The method deliberately introduces random numerical noise into computations, which is of the same order of magnitude as the floating point precision. Accordingly, repeated runs of an algorithm give slightly different results, which can be analyzed statistically to obtain precise estimates of its numerical stability. This noise is produced by automatic code injection into regular compiler output, so that no substantial programming effort is required, only a recompilation of the affected program sections. The method is applied to investigate: (i) the numerical stability of the three-center Obara-Saika integral evaluation scheme for high angular momenta, (ii) if coupled cluster perturbative triples can be evaluated with single precision arithmetic, (iii) how to implement the density fitting approximation in Moller-Plesset perturbation theory (MP2) most accurately, and (iv) which parts of density fitted MP2 can be safely evaluated with single precision arithmetic. In the integral case, we find a numerical instability in an equation that is used in almost all integral programs. Due to the results of (ii) and (iv), we conjecture that single precision arithmetic can be applied whenever a calculation is done in an orthogonal basis set and excessively long linear sums are avoided.},
added-at = {2019-03-01T15:49:42.000+0100},
author = {Knizia, Gerald and Li, Wenbin and Simon, Sven and Werner, Hans Joachim},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2116541fae2c1d74f8d2364784fc25dc4/theochem},
doi = {10.1021/ct200239p},
interhash = {1513e8c0db3834b9d222c4121c7372c6},
intrahash = {116541fae2c1d74f8d2364784fc25dc4},
issn = {15499618},
journal = {J. Chem. Theory Comput.},
keywords = {chemie imported werner from:alexanderdenzel theoretische stuttgart theochem},
number = 8,
pages = {2387–2398},
timestamp = {2019-03-01T14:49:42.000+0100},
title = {{Determining the numerical stability of quantum chemistry algorithms}},
url = {http://dx.doi.org/10.1021/ct200239p},
volume = 7,
year = 2011
}
