Automatic numerical integration techniques for polyatomic molecules
- 1 May 1994
- journal article
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 100 (9) , 6520-6534
- https://doi.org/10.1063/1.467061
Abstract
We describe a new algorithm for the generation of 3D grids for the numerical evaluation of multicenter molecular integrals in density functional theory. First, we use the nuclear weight functions method of Becke [A. D. Becke, J. Chem. Phys. 88, 2547 (1988)] to decompose a multicenter integral ∫F(r) dr into a sum of atomic‐like single‐center integrals. Then, we apply automatic numerical integration techniques to evaluate each of these atomic‐like integrals, so that the total integral is approximated as ∫F(r) dr≊∑iωiF(ri). The set of abscissas ri and weights ωi constitutes the 3D grid. The 3D atomic‐like integrals are arranged as three successive monodimensional integrals, each of which is computed according to a recently proposed monodimensional automatic numerical integration scheme which is able to determine how many points are needed to achieve a given accuracy. When this monodimensional algorithm is applied to 3D integration, the 3D grids obtained adapt themselves to the shape of the integrand F(r), and have more points in more difficult regions. The function F(r), which, upon numerical integration, yields the 3D grid, is called the generating function of the grid. We have used promolecule densities as generating functions, and have checked that grids generated from promolecule densities are also accurate for other integrands. Our scheme is very reliable in the sense that, given a relative tolerance ε, it generates 3D grids which are able to approximate multicenter integrals with relative errors smaller than ε for all the molecules tested in this work. Coarser or finer grids can be obtained using greater or smaller tolerances. For a series of 21 molecules, the average number of points per atom for ε=2.0⋅10−3, ε=2.0⋅10−4, ε=2.0⋅10−5, ε=2.0⋅10−6, and ε=2.0⋅10−7 is respectively 3141 (2.9⋅10−4), 10271 (2.4⋅10−5), 27184 (3.1⋅10−6), 72266 (1.9⋅10−7), and 164944 (5.2⋅10−9) (in parentheses are the maximum errors obtained when integrating the density). It is possible to reduce the number of points in the grid by taking advantage of molecular symmetry. It seems that our method achieves a given accuracy with fewer points than other recently proposed methods.Keywords
This publication has 71 references indexed in Scilit:
- A simple, efficient and more reliable scheme for automatic numerical integrationComputer Physics Communications, 1993
- A simple, reliable and efficient scheme for automatic numerical integrationComputer Physics Communications, 1992
- A test of the Hirshfeld definition of atomic charges and momentsTheoretical Chemistry Accounts, 1992
- Numerical integration over a spherical shellComputer Physics Communications, 1989
- Numerical solution of Poisson’s equation in polyatomic moleculesThe Journal of Chemical Physics, 1988
- Product-integration with the Clenshaw-Curtis and related pointsNumerische Mathematik, 1978
- Crystal structures of two local anesthetics: Dibucaine·HCl·H2O and Dimethisoquin·HCl·H2OJournal of Chemical Crystallography, 1977
- The efficiency of extrapolation methods for numerical integrationNumerische Mathematik, 1971
- Bemerkungen zur Romberg-IntegrationNumerische Mathematik, 1964
- A method for numerical integration on an automatic computerNumerische Mathematik, 1960