zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A two-grid discretization scheme for semilinear elliptic eigenvalue problems. (English) Zbl 1095.65100

Summary: We present a two-grid finite element discretization scheme with a two-loop continuation algorithm for tracing solution branches of semilinear elliptic eigenvalue problems. First we use the predictor-corrector continuation method to compute an approximating point for the solution curve on the coarse grid. Then we use this approximating point as a predicted point for the solution curve on the fine grid. In the corrector step we solve the first and the second order approximations of the nonlinear partial differential equation to obtain corrections for the state variable on the fine grid and the coarse grid, respectively. The continuation parameter is updated by computing the Rayleigh quotient on the fine space.

To guarantee the approximating point we just obtained lies on the solution curve, we perform Newton’s method. We repeat the process described above until the solution curve on the fine space is obtained. We show how the singular points, such as folds and bifurcation points, can be well approximated. Comprehensive numerical experiments show that the two-grid finite element discretization scheme with a two-loop continuation algorithm is efficient and robust for solving second order semilinear elliptic eigenvalue problems.


MSC:
65N25Numerical methods for eigenvalue problems (BVP of PDE)
65N55Multigrid methods; domain decomposition (BVP of PDE)
65P30Bifurcation problems (numerical analysis)
65N30Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods (BVP of PDE)