Convergence analysis of discrete high-index saddle dynamics
From MaRDI portal
Publication:5043630
Abstract: Saddle dynamics is a time continuous dynamics to efficiently compute the any-index saddle points and construct the solution landscape. In practice, the saddle dynamics needs to be discretized for numerical computations, while the corresponding numerical analysis are rarely studied in the literature, especially for the high-index cases. In this paper we propose the convergence analysis of discrete high-index saddle dynamics. To be specific, we prove the local linear convergence rates of numerical schemes of high-index saddle dynamics, which indicates that the local curvature in the neighborhood of the saddle point and the accuracy of computing the eigenfunctions are main factors that affect the convergence of discrete saddle dynamics. The proved results serve as compensations for the convergence analysis of high-index saddle dynamics and are substantiated by numerical experiments.
Recommendations
- Error estimates for Euler discretization of high-index saddle dynamics
- Constrained high-index saddle dynamics for the solution landscape with equality constraints
- Searching the solution landscape by generalized high-index saddle dynamics
- High-index optimization-based shrinking dimer method for finding high-index saddle points
- An iterative minimization formulation for saddle point search
Cites work
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A dimer-type saddle search algorithm with preconditioning and linesearch
- A minimax method for finding multiple critical points and its applications to semilinear PDEs
- An iterative minimization formulation for saddle point search
- Constrained high-index saddle dynamics for the solution landscape with equality constraints
- Convergence and cycling in Walker-type saddle search algorithms
- Error estimates for Euler discretization of high-index saddle dynamics
- High-index optimization-based shrinking dimer method for finding high-index saddle points
- Introductory lectures on convex optimization. A basic course.
- Modelling and computation of liquid crystals
- Optimization-based shrinking dimer method for finding transition states
- Searching the solution landscape by generalized high-index saddle dynamics
- Shrinking dimer dynamics and its applications to saddle point search
- Simultaneous Rayleigh-quotient minimization methods for Ax=lambdaBx
- Solution landscape of a reduced Landau-de Gennes model on a hexagon
- Solution landscape of the Onsager model identifies non-axisymmetric critical points
- Testing Unconstrained Optimization Software
- The gentlest ascent dynamics
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Transition pathways between defect patterns in confined nematic liquid crystals
Cited in
(9)- Switched diffusion processes for non-convex optimization and saddle points search
- Error estimates for Euler discretization of high-index saddle dynamics
- Accelerated high-index saddle dynamics method for searching high-index saddle points
- Searching the solution landscape by generalized high-index saddle dynamics
- Constrained high-index saddle dynamics for the solution landscape with equality constraints
- Construction of solution landscapes for complex systems
- Probabilistic error estimate for numerical discretization of high-index saddle dynamics with inaccurate models
- Discretization and index-robust error analysis for constrained high-index saddle dynamics on the high-dimensional sphere
- A model-free shrinking-dimer saddle dynamics for finding saddle point and solution landscape
This page was built for publication: Convergence analysis of discrete high-index saddle dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043630)