Two classes of Ljusternik–Schnirelman minimax algorithms and an application for finding multiple negative energy solutions of a class of p-Laplacian equations

作者:

Highlights:

摘要

In this paper, two classes of LS-minimax algorithms are presented, they are applied to numerically find multiple negative energy solutions of the p-Laplacian equation −Δpu=λ|u|r−1u+|u|q−1u,x∈Ω⊂Rl,u=0,x∈∂Ω,where Ω is an open bounded domain, 00, and p∗ is the Sobolev exponent, and mathematical justification and global convergence result for them are established. By combining LS-minimax algorithm with the finite element method, it is verified that, as element size goes to zero, numerical solutions of p-Laplacian equation captured by LS-minimax algorithm converge to solutions of p-Laplacian equation. Two LS-minimax algorithms developed in [1] are two special algorithms in these two classes of algorithms.

论文关键词:58E05,58E30,35J92,65N12,65N30,Ljusternik–Schnirelman critical point theory,Ljusternik–Schnirelman minimax algorithm, p-Laplacian equation,Finite element method,Convergence

论文评审过程:Received 4 October 2016, Revised 14 May 2017, Available online 27 April 2018, Version of Record 16 May 2018.

论文官网地址:https://doi.org/10.1016/j.cam.2018.04.020