HOME PAGE
CURRICULUM VITAE
RESEARCH
PUBLICATIONS
TEACHING
WORKSHOPS
AND CONFERENCES
TALKS
LINKS


An iterative finite element method with adaptivity for multiple eigenvalues

2012, ESCO 2012, Pilsen 

Abstract:
We consider the task of resolving accurately the $n$th eigenpair of a generalized
eigenproblem rooted in some elliptic partial differential equation (PDE), using an adaptive finite
element method (FEM).
Conventional adaptive FEM algorithms call a generalized eigensolver after
each mesh refinement step. This is not practical in our situation since the generalized eigensolver
needs to calculate $n$ eigenpairs after each mesh refinement step, it can switch the order of eigenpairs,
and for repeated eigenvalues it can return an arbitrary linear combination of eigenfunctions from
the corresponding eigenspace. Especially when adaptivity is used to target an eigenpair of a multiple
eigenvalue, the change in the linear combination of eigenfunctions may reduce the convergence rate of
the method.
In order to circumvent these problems, we propose a novel adaptive
algorithm that only calls the eigensolver once at the beginning of the computation, and then employs
an iterative method to pursue a selected eigenvalueeigenfunction pair on a sequence of locally refined
meshes. Both Picard’s and Newton’s variants of the iterative method are presented. The underlying
partial differential equation (PDE) is discretized with higherorder finite elements (hpFEM) but
the algorithm also works for standard loworder FEM.

Download:

PDF (356KB)

