Saddle Point SearchThis is a featured page

Local Search Methods

The automated surface walking algorithm is one of the original saddle point search methods. With local quadratic approximations of PES, the search is based on eigenvectors of the Hessian matrix, which is updated iteratively similar to the quasi-Newton technique. It also involves the scaling of one of the active coordinates in order to make the Hessian eigenvalues lie in a required range. In the partitioned rational function optimization method, PES is approximated by rationalized quadratic surfaces, and the search is conducted by partitioning the minimax problem into two separate maximization and minimization subproblems.
References:
More recently, the ridge method searches the saddle point by traveling down along the ridge with a pair of images. The direction of the connecting line between the two images can be constrained to make sure the pair is kept on the ridge. Similarly, the dimer method searches the saddle point based on a pair of images. However, the small distance between the two images is fixed. Starting from one basin, the dimer moves uphill in the translation step. In the rotation step, it rotates towards the lowest curvature mode of PES by minimizing the dimer energy through the conjugate gradient approach. Later in the improved dimer method, the curvature is calculated differently with reduced numbers of gradient calculations to improve the performance and robustness under numerical noises. In the synchronous transit method, the transition state is initially estimated by minimizing the interpolated inter-atomic distances. Then the saddle point estimate is further refined with the conjugate gradient optimization. In the reduced gradient following method and the reduced potential energy surface model method, stationary points are intersections of zero-gradient curves and surfaces respectively with distinguished coordinates removed. Saddle point search is within the subspace of these zero-gradient curves or surfaces.
References:

Global Search Methods

Different from local search, the global search methods ensure the saddle point with the maximum energy is located if the search converges to one. The DHS method searches the saddle point by iteratively reducing the distance between reactant and product images while minimizing the energy subject to the equal distance constraint at each step. The Activation-Relaxation Technique searches saddle points in two steps. In the activation step, one image jumps from a local minimum towards a saddle point according to a controlled force. In the relaxation step, it moves from the saddle point to another minimum. Thus it can traverse many saddle points without the knowledge of final product. In the Step and Slide method, the energy levels of two images from the initial and final states are gradually increased. Then the distance between the two is minimized while both images are kept in the same isoenergy surfaces. The interval Newton’s method finds all stationary points by solving the equation of vanishing gradient.
References:



No user avatar
yan.wang
Latest page update: made by yan.wang , Aug 7 2008, 4:24 PM EDT (about this update About This Update yan.wang saddle point search added - yan.wang

892 words added

view changes

- complete history)
Keyword tags: None
More Info: links to this page
There are no threads for this page.  Be the first to start a new thread.