225 research outputs found

    Constrained high-index saddle dynamics for the solution landscape with equality constraints

    Full text link
    We propose a constrained high-index saddle dynamics (CHiSD) to search index-kk saddle points of an energy functional subject to equality constraints. With Riemannian manifold tools, the CHiSD is derived in a minimax framework, and its linear stability at the index-kk saddle point is proved. To ensure the manifold properties, the CHiSD is numerically implemented using retractions and vector transport. Then we present a numerical approach by combining CHiSD with downward and upward search algorithms to construct the solution landscape with equality constraints. We apply the Thomson problem and the Bose--Einstein condensation as the numerical examples to demonstrate the efficiency of the proposed method

    A dimer-type saddle search algorithm with preconditioning and linesearch

    Get PDF
    The dimer method is a Hessian-free algorithm for computing saddle points. We augment the method with a linesearch mechanism for automatic step size selection as well as preconditioning capabilities. We prove local linear convergence. A series of numerical tests demonstrate significant performance gains

    Nonmonotone local minimax methods for finding multiple saddle points

    Full text link
    In this paper, by designing a normalized nonmonotone search strategy with the Barzilai--Borwein-type step-size, a novel local minimax method (LMM), which is a globally convergent iterative method, is proposed and analyzed to find multiple (unstable) saddle points of nonconvex functionals in Hilbert spaces. Compared to traditional LMMs with monotone search strategies, this approach, which does not require strict decrease of the objective functional value at each iterative step, is observed to converge faster with less computations. Firstly, based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold, by generalizing the Zhang--Hager (ZH) search strategy in the optimization theory to the LMM framework, a kind of normalized ZH-type nonmonotone step-size search strategy is introduced, and then a novel nonmonotone LMM is constructed. Its feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative sequences. Secondly, in order to speed up the convergence of the nonmonotone LMM, a globally convergent Barzilai--Borwein-type LMM (GBBLMM) is presented by explicitly constructing the Barzilai--Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each iteration. Finally, the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures: one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary conditions. Extensive numerical results indicate that our approach is very effective and speeds up the LMMs significantly.Comment: 32 pages, 7 figures; Accepted by Journal of Computational Mathematics on January 3, 202
    • …
    corecore