DIIS
   HOME

TheInfoList



OR:

DIIS (direct inversion in the iterative subspace or direct inversion of the iterative subspace), also known as Pulay mixing, is a technique for extrapolating the solution to a set of linear equations by directly minimizing an error residual (e.g. a
Newton–Raphson In numerical analysis, the Newton–Raphson method, also known simply as Newton's method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a ...
step size) with respect to a linear combination of known sample vectors. DIIS was developed by Peter Pulay in the field of computational
quantum chemistry Quantum chemistry, also called molecular quantum mechanics, is a branch of physical chemistry focused on the application of quantum mechanics to chemical systems, particularly towards the quantum-mechanical calculation of electronic contributions ...
with the intent to accelerate and stabilize the
convergence Convergence may refer to: Arts and media Literature *''Convergence'' (book series), edited by Ruth Nanda Anshen *Convergence (comics), "Convergence" (comics), two separate story lines published by DC Comics: **A four-part crossover storyline that ...
of the Hartree–Fock self-consistent field method. At a given iteration, the approach constructs a
linear combination In mathematics, a linear combination or superposition is an Expression (mathematics), expression constructed from a Set (mathematics), set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of ''x'' a ...
of approximate error vectors from previous iterations. The coefficients of the linear combination are determined so to best approximate, in a
least squares The method of least squares is a mathematical optimization technique that aims to determine the best fit function by minimizing the sum of the squares of the differences between the observed values and the predicted values of the model. The me ...
sense, the
null vector In mathematics, given a vector space ''X'' with an associated quadratic form ''q'', written , a null vector or isotropic vector is a non-zero element ''x'' of ''X'' for which . In the theory of real bilinear forms, definite quadratic forms an ...
. The newly determined coefficients are then used to extrapolate the function variable for the next iteration.


Details

At each iteration, an approximate error vector, , corresponding to the variable value, is determined. After sufficient iterations, a linear combination of previous error vectors is constructed :\mathbf e_=\sum_^m\ c_i\mathbf e_i. The DIIS method seeks to minimize the norm of under the constraint that the coefficients sum to one. The reason why the coefficients must sum to one can be seen if we write the trial vector as the sum of the exact solution () and an error vector. In the DIIS approximation, we get: : \begin \mathbf p &= \sum_i c_i \left( \mathbf p^\text + \mathbf e_i \right) \\ &= \mathbf p^\text \sum_i c_i + \sum_i c_i \mathbf e_i \end 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 In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function (mathematics), function subject to constraint (mathematics), equation constraints (i.e., subject to the conditio ...
technique. Introducing an undetermined multiplier , a Lagrangian is constructed as : \begin L&=\left\, \mathbf e_\right\, ^2-2\lambda\left(\sum_i\ c_i-1\right),\\ &=\sum_c_jB_c_i-2\lambda\left(\sum_i\ c_i-1\right),\text B_=\langle\mathbf e_j, \mathbf e_i\rangle. \end Equating zero to the derivatives of with respect to the coefficients and the multiplier leads to a system of
linear equation In mathematics, a linear equation is an equation that may be put in the form a_1x_1+\ldots+a_nx_n+b=0, where x_1,\ldots,x_n are the variables (or unknowns), and b,a_1,\ldots,a_n are the coefficients, which are often real numbers. The coeffici ...
s to be solved for the coefficients (and the Lagrange multiplier). :\begin B_ & B_ & B_ & ... & B_ & -1 \\ B_ & B_ & B_ & ... & B_ & -1 \\ B_ & B_ & B_ & ... & B_ & -1 \\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots \\ B_ & B_ & B_ & ... & B_ & -1 \\ 1 & 1 & 1 & ... & 1 & 0 \end \begin c_1 \\ c_2 \\ c_3 \\ \vdots \\ c_m \\ \lambda \end= \begin 0 \\ 0 \\ 0 \\ \vdots \\ 0 \\ 1 \end Moving the minus sign to , results in an equivalent symmetric problem. :\begin B_ & B_ & B_ & ... & B_ & 1 \\ B_ & B_ & B_ & ... & B_ & 1 \\ B_ & B_ & B_ & ... & B_ & 1 \\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots \\ B_ & B_ & B_ & ... & B_ & 1 \\ 1 & 1 & 1 & ... & 1 & 0 \end \begin c_1 \\ c_2 \\ c_3 \\ \vdots \\ c_m \\ -\lambda \end= \begin 0 \\ 0 \\ 0 \\ \vdots \\ 0 \\ 1 \end The coefficients are then used to update the variable as :\mathbf p_=\sum_^m c_i\mathbf p_i.


References


Literature

* * {{Cite journal, doi=10.1007/s10910-011-9863-y, title=An analysis for the DIIS acceleration method used in quantum chemistry calculations, year=2011, last1=Rohwedder, first1=Thorsten, last2=Schneider, first2=Reinhold, journal=Journal of Mathematical Chemistry, volume=49, issue=9, pages=1889, citeseerx=10.1.1.461.1285, s2cid=51759476


See also

*
GMRES In mathematics, the generalized minimal residual method (GMRES) is an iterative method for the numerical solution of an indefinite nonsymmetric system of linear equations. The method approximates the solution by the vector in a Krylov subspace wit ...


External links


The Mathematics of DIIS
Quantum chemistry Computational chemistry Numerical linear algebra