Krylov subspace accelerated inexact Newton method for linear and nonlinear equations

A Krylov subspace accelerated inexact Newton (KAIN) method for solving linear and nonlinear equations is described, and its relationship to the popular direct inversion in the iterative subspace method [DIIS; Pulay, P., Chem Phys Lett 1980, 393, 73] is analyzed. The two methods are compared with application to simple test equations and the location of the minimum energy crossing point of potential energy surfaces. KAIN is no more complicated to implement than DIIS, but can accommodate a wider variety of preconditioning and performs substantially better with poor preconditioning. With perfect preconditioning, KAIN is shown to be very similar to DIIS. For these reasons, KAIN is recommended as a replacement for DIIS. © 2003 Wiley Periodicals, Inc. J Comput Chem 25: 328–334, 2004

[1]  R. Dembo,et al.  INEXACT NEWTON METHODS , 1982 .

[2]  Gerard L. G. Sleijpen,et al.  A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems , 1996, SIAM J. Matrix Anal. Appl..

[3]  Yousef Saad,et al.  Hybrid Krylov Methods for Nonlinear Systems of Equations , 1990, SIAM J. Sci. Comput..

[4]  H. Sellers,et al.  The C2‐DIIS convergence acceleration algorithm , 1993 .

[5]  Peter Pulay,et al.  Geometry optimization by direct inversion in the iterative subspace , 1984 .

[6]  John A. Pople,et al.  Self-consistent molecular orbital methods. XVI. Numerically stable direct energy minimization procedures for solution of Hartree-Fock equations , 1976 .

[7]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[8]  Henry F. Schaefer,et al.  Accelerating the convergence of the coupled-cluster approach: The use of the DIIS method , 1986 .

[9]  Jeremy N. Harvey,et al.  DFT Computation of the Intrinsic Barrier to CO Geminate Recombination with Heme Compounds , 2000 .

[10]  Gerard L. G. Sleijpen,et al.  Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations , 1998, SIAM J. Sci. Comput..

[11]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[12]  H. Schlegel,et al.  Optimization of equilibrium geometries and transition structures , 1982 .

[13]  P. Pulay.  Convergence acceleration of iterative sequences. the case of scf iteration , 1980 .

[14]  C. Kelley.  Iterative Methods for Linear and Nonlinear Equations , 1987 .

[15]  E. Davidson.  The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .

[16]  Jan Almlöf,et al.  General methods for geometry and wave function optimization , 1992 .

[17]  Harrell Sellers.  ADEM-DIOS: an SCF convergence algorothm for difficult cases , 1991 .

[18]  A. J. Sadlej,et al.  Comments on the geometric approximation to the second-order perturbed energies , 1978 .

[19]  P. Pulay.  Improved SCF convergence acceleration , 1982 .

[20]  Rodney J. Bartlett,et al.  The reduced linear equation method in coupled cluster theory. , 1981 .