Finding saddle points of mountain pass type with quadratic models on affine spaces
From MaRDI portal
Publication:6226703
arXiv1107.4287MaRDI QIDQ6226703FDOQ6226703
Authors: C. H. Jeffrey Pang 
Publication date: 21 July 2011
Abstract: The problem of computing saddle points is important in certain problems in numerical partial differential equations and computational chemistry, and is often solved numerically by a minimization problem over a set of mountain passes. We propose an algorithm to find saddle points of mountain pass type to find the bottlenecks of optimal mountain passes. The key step is to minimize the distance between level sets by using quadratic models on affine spaces similar to the strategy in the conjugate gradient algorithm. We discuss parameter choices, convergence results, and how to augment the algorithm to a path based method. Finally, we perform numerical experiments to test the convergence of our algorithm.
Iterative numerical methods for linear systems (65F10) Critical points of functionals in context of PDEs (e.g., energy functionals) (35B38) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12)
This page was built for publication: Finding saddle points of mountain pass type with quadratic models on affine spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6226703)
