BERNY algorithm

Then orthonormal unit vectors are constructed such that 

A significant advantage of this procedure is that nearly linearly dependent vectors can be eliminated at this stage, simply reducing the value of m. The resulting unit vectors define an n x in column matrix. Using these unit vectors, the algorithm solves anmxm system of linear equations in the e-space, 

The matrix (Aqte)is lower-triangular by construction. For the index range j i m, solution matrix elements are determined by 

In these equations, the matrix (Apt e) is no longer triangular. However, the additional computational effort may be unimportant if the number of iterative steps can be reduced, thus saving energy and gradient evaluations. The matrix e Ge is to be symmetrized before updating G. The incremental matrix is 

---

The optimization of a transition structure will be much faster using methods for which the Hessian can be analytically calculated. For methods that incrementally compute the Hessian (i.e., the Berny algorithm), it is fastest to start with a Hessian from some simpler calculation, such as a semiempirical calculation. Occasionally, dilficulties are encountered due to these simpler methods giving a poor description of the Hessian. An option to compute the initial Hessian at the desired level of theory is often available to circumvent this problem at the expense of additional CPU time. 

The minimum and transition state optimizations performed in this thesis have been performed using the Berny algorithm [56] implemented in the Gaussian 03 program package [57]. 

The default method in GAUSSIAN 88-92 (BERNY) employs a variable metric method which takes a Newton-Raphson step if the correct number of negative eigenvalues is found in the Hessian and aborts otherwise. While this action may avoid wasting computer time on a fruitless search for a stationary point, in many cases the algorithm can recover from this situation by simply... 

Cmbined methds. There are numerous other methods in the literature for finding transition states. However, the more common methods use simpler numerical algorithms in a more efficient way. The Berny optimization algorithm and the synchronous transit quasi-newton method (STQN) are good examples. 

---