For each basis function
,
centered at
,
a sphere is defined beyond which its influence is deemed negligible. The radius of the sphere,
,
is found from choosing a threshold
and requiring that
for every point outside the sphere. For any grid point
all significant basis functions can be found by selecting those that fulfill
Therefore a list of all significant basis functions is created for every grid point. The important property of the list is that the number of significant basis functions at each grid point becomes independent of size for sufficiently large molecules. The construction of this list is an O(N2) process -- (number of grid points) x (number of basis functions), but Stratman et al. [149] have noticed that the computational time involved is insignificant for even very large molecules (
C384H48). If the formation of this list becomes a problem in the future, Pérez-Jordá and Yang [150] have reformulated the algorithm into one which scales as
.
The density at any grid point is given by
which forces the evaluation of the density to scale as O(N3). However, if the summation is restricted to only those basis functions which are significant at the grid point, the computational effort per grid point becomes independent of size (for a sufficiently large molecule) and the density evaluation should scale linearly with the molecular size.