Convergence Results of a Local Minimax Method for Finding Multiple Critical Points
نویسندگان
چکیده
In [14], a new local minimax method that characterizes a saddle point as a solution to a local minimax problem is established. Based on the local characterization, a numerical minimax algorithm is designed for finding multiple saddle points. Numerical computations of many examples in semilinear elliptic PDE have been successfully carried out to solve for multiple solutions. One of the important issues remains unsolved, i.e., the convergence of the numerical minimax method. In this paper, first, Step 5 in the algorithm is modified with the design of a new stepsize rule which is practically easier to implement and with which convergence results of the numerical minimax method are established for isolated and non-isolated critical points. The convergence results show that the algorithm indeed exceeds the scope of a minimax principle. In the last section, numerical multiple solutions to the Henon’s equation and a sublinear elliptic equation subject to zero Dirichlet boundary condition are presented to show their numerical convergence and profiles.
منابع مشابه
Convergence Results of A Minimax Method for Finding Multiple Critical Points
In [12], new local minimax theorems which characterize a saddle point as a solution to a two-level local minimax problem are established. Based on the local characterization, a numerical minimax method is designed for finding multiple saddle points. Many numerical examples in semilinear elliptic PDE have been successfully carried out to solve for multiple solutions. One of the important issues ...
متن کاملA Minimax Method for Finding Multiple Critical Points and Its Applications to Semilinear PDEs
Most minimax theorems in critical point theory require to solve a two-level global optimization problem and therefore are not for algorithm implementation. The objective of this research is to develop numerical algorithms and corresponding mathematical theory for finding multiple saddle points in a stable way. In this paper, inspired by the numerical works of Choi-McKenna and Ding-Costa-Chen, a...
متن کاملOn Finding Multiple Solutions to a Singularly Perturbed Neumann Problem
In this paper, in order to numerically solve for multiple positive solutions to a singularly perturbed Neumann boundary value problem in mathematical biology and other applications, a local minimax method is modified with new local mesh refinement and other strategies. Algorithm convergence and other related properties are verified. Motivated by the numerical algorithm and convinced by the nume...
متن کاملUnified Convergence Results on a Minimax Algorithm for Finding Multiple Critical Points in Banach Spaces
A minimax method for finding multiple critical points in Banach spaces is successfully developed in [12] by using a projected pseudo-gradient as a search direction. Since several different techniques can be used to compute a projected pseudo-gradient, the uniform stepsize and the continuity of a search direction, two key properties for the convergence results in [5], get lost. In this paper, in...
متن کاملA Local Minimax-Newton Method for Finding Multiple Saddle Points with Symmetries
In this paper, a local minimax-Newton method is developed to solve for multiple saddle points. The local minimax method [15] is used to locate an initial guess and a version of the generalized Newton method is used to speed up convergence. When a problem possesses a symmetry, the local minimax method is invariant to the symmetry. Thus the symmetry can be used to greatly enhance the efficiency a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2003