B AOInts

B.9 Quadratic Scaling

The success of quantitative modern quantum chemistry, relative to its primitive, qualitative beginnings, can be traced to two sources: better algorithms and better computers. While the two technologies continue to improve rapidly, efforts are heavily thwarted by the fact that the total number of ERIs increases quadratically with the size of the molecular system. Even large increases in ERI algorithm efficiency yield only moderate increases in applicability, hindering the more widespread application of ab initio methods to areas of, perhaps, biochemical significance where semi-empirical techniquesDewar:1969, Dewar:1993 have already proven so valuable.

Thus, the elimination of quadratic scaling algorithms has been the theme of many research efforts in quantum chemistry throughout the 1990s and has seen the construction of many alternative algorithms to alleviate the problem. Johnson was the first to implement DFT exchange/correlation functionals whose computational cost scaled linearly with system size.Johnson:1993c This paved the way for the most significant breakthrough in the area with the linear scaling CFMM algorithmWhite:1994a leading to linear scaling DFT calculations.White:1996a Further breakthroughs have been made with traditional theory in the form of the QCTCChallacombe:1996a, Challacombe:1996b, Challacombe:1997 and ONXSchwegler:1996a, Schwegler:1996b algorithms, while more radical approachesAdamson:1996, Dombroski:1996 may lead to entirely new approaches to ab initio calculations. Investigations into the quadratic Coulomb problem has not only yielded linear scaling algorithms, but is also providing large insights into the significance of many molecular energy components.

Linear scaling Coulomb and SCF exchange/correlation algorithms are not the end of the story as the 𝒪(N3) diagonalization step has been rate limiting in semi-empirical techniques and, been predicted to become rate limiting in ab initio approaches in the medium term.Strout:1995 However, divide-and-conquer techniquesYang:1991a, Yang:1991b, Yang:1995, Lee:1996 and the recently developed quadratically convergent SCF algorithmOchsenfeld:1997 show great promise for reducing this problem.