DIIS

DIIS (direct inversion in the iterative subspace or direct inversion of the iterative subspace), also known as Pulay mixing, is an extrapolation technique. DIIS was developed by Peter Pulay in the field of computational quantum chemistry with the intent to accelerate and stabilize the convergence of the Hartree–Fock self-consistent field method.[1][2]

At a given iteration, the approach constructs a linear combination of approximate error vectors from previous iterations. The coefficients of the linear combination are determined so to best approximate, in a least squares sense, the null vector. The newly determined coefficients are then used to extrapolate the function variable for the next iteration.

Details

At each iteration, an approximate error vector, ei, corresponding to the variable value, pi is determined. After sufficient iterations, a linear combination of m previous error vectors is constructed

\mathbf e_{m+1}=\sum_{i = 1}^m\ c_i\mathbf e_i.

The DIIS method seeks to minimize the norm of em+1 under the constraint that the coefficients sum to one. The reason why the coefficients must sum to one be can seen if we write the trial vector as the sum of the exact solution (pf) and an error vector. In the DIIS approximation, we get:

\begin{align} \mathbf p &= \sum_i c_i \left( \mathbf p^\text{f} + \mathbf e_i \right) \\ &= \mathbf p^\text{f} \sum_i c_i + \sum_i c_i \mathbf e_i \end{align}

We minimize the second term while it is clear that the sum coefficients must be equal to one if we want to find the exact solution. The minimization is done by a Lagrange multiplier technique. Introducing an undetermined multiplier λ, a Lagrangian is constructed as

\begin{align} L&=\left\|\mathbf e_{m+1}\right\|^2-\lambda\left(\sum_i\ c_i-1\right),\\ &=\sum_{ij}c_jB_{ji}c_i-\lambda\left(\sum_i\ c_i-1\right),\text{ where } B_{ij}=\langle\mathbf e_j, \mathbf e_i\rangle. \end{align}

Equating zero to the derivatives of L with respect to the coefficients and the multiplier leads to a system of (m + 1) linear equations to be solved for the m coefficients (and the Lagrange multiplier). The coefficients are then used to update the variable as

\mathbf p_{m+1}=\sum_{i = 1}^m c_i\mathbf p_i.

Citations

  1. ↑ Pulay, Péter (1980). "Convergence acceleration of iterative sequences. the case of SCF iteration". Chemical Physics Letters 73 (2): 393–398. doi:10.1016/0009-2614(80)80396-4.
  2. ↑ Pulay, Péter (1982). "Improved SCF Convergence Acceleration". Journal of Computational Chemistry 3 (4): 556–560. doi:10.1002/jcc.540030413.

References

External links