Ljusternik-Schnirelman minimax algorithms and an application for finding multiple negative energy solutions of semilinear elliptic Dirichlet problem involving concave and convex nonlinearities. I: Algorithms and convergence (Q283281)

From MaRDI portal





scientific article; zbMATH DE number 6580430
Language Label Description Also known as
default for all languages
No label defined
    English
    Ljusternik-Schnirelman minimax algorithms and an application for finding multiple negative energy solutions of semilinear elliptic Dirichlet problem involving concave and convex nonlinearities. I: Algorithms and convergence
    scientific article; zbMATH DE number 6580430

      Statements

      Ljusternik-Schnirelman minimax algorithms and an application for finding multiple negative energy solutions of semilinear elliptic Dirichlet problem involving concave and convex nonlinearities. I: Algorithms and convergence (English)
      0 references
      0 references
      13 May 2016
      0 references
      The paper under review establishes two minimax algorithms related to the Ljusternik-Schnirelman theory, which is a central tool in critical point theory. Related global sequence convergence properties are also proved in this paper. The final section contains a numerical experiment to calculate multiple negative energy solutions of a semilinear elliptic equation with Dirichlet boundary condition.
      0 references
      Ljusternik-Schnirelman critical point theory
      0 references
      Ljusternik-Schnirelman minimax algorithm
      0 references
      semilinear elliptic equation
      0 references
      concave and convex nonlinearities
      0 references
      finite element method
      0 references
      convergence
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references