Refine
Language
- English (5)
Keywords
- adaptive finite element method (3)
- eigenvalue (3)
- DWR (1)
- adaptive (1)
- complexity (1)
- convergence rates (1)
- dual-weighted (1)
- eigenfunction (1)
- eigenvalue problem (1)
- finite element method (1)
Project
- C22 (5) (remove)
Application Area
- C (5)
This paper presents three different adaptive algorithms for eigenvalue problems
associated with non-selfadjoint partial differential
operators. The basis for the developed algorithms is a homotopy method.
The homotopy method starts from a well-understood selfadjoint problem,
for which well-established adaptive methods are available.
Apart from the adaptive grid refinement, the progress of the homotopy as
well as the solution of the iterative method are adapted to balance the contributions
of the different error sources.
The first algorithm balances the homotopy, discretization and approximation errors with respect
to a fixed step-size $\tau$ in the homotopy.
The second algorithm combines the adaptive step-size control for the homotopy
with an adaptation in space that ensures an error below a fixed tolerance $\varepsilon$.
The third algorithm allows the complete adaptivity in space,
homotopy step-size as well as the iterative algebraic eigenvalue solver.
All three algorithms are compared in numerical examples.
A posteriori error estimators for non-symmetric eigenvalue model problems are discussed in [Heuveline and Rannacher, A posteriori error control for finite element approximations of elliptic eigenvalue problems, 2001] in the context of the dual-weighted residual method (DWR). This paper directly analyses the variational formulation rather than the non-linear ansatz of Becker and Rannacher for some convection-diffusion model problem and presents error estimators for the eigenvalue error based on averaging techniques. In the case of linear P1 finite elements and globally constant coefficients, the error estimates of the residual and averaging error estimators are refined. Moreover, several postprocessing techniques attached to the DWR paradigm plus two new dual-weighted error estimators are compared in numerical experiments. The first new estimator utilises an auxiliary Raviart-Thomas mixed finite element method and the second exploits an averaging technique in combination with ideas of DWR.
This paper presents a combined adaptive finite element method with an iterative algebraic eigenvalue solver for the Laplace eigenvalue problem of quasi-optimal computational complexity. The analysis is based on a direct approach for eigenvalue problems and allows the use of higher order conforming finite element spaces with fixed polynomial degree k>0. The optimal adaptive finite element eigenvalue solver (AFEMES) involves a proper termination criterion for the algebraic eigenvalue solver and does not need any coarsening. Numerical evidence illustrates the optimal computational complexity.
This paper discusses adaptive finite element methods (AFEMs) for the solution of elliptic eigenvalue problems associated with partial differential operators. An adaptive method based on nodal-patch refinement leads to an asymptotic error reduction property for the computed sequence of simple eigenvalues and eigenfunctions. This justifies the use of the proven saturation property for a class of reliable and efficient hierarchical a posteriori error estimators. Numerical experiments confirm that the saturation property is present even for very coarse meshes for many examples; in other cases the smallness assumption on the initial mesh may be severe.
Explicit Error Estimates for Courant, Crouzeix-Raviart and Raviart-Thomas Finite Element Methods
(2011)
The elementary analysis of this paper presents explicit expressions of the constants in the a priori error estimates for the lowest-order Courant, Crouzeix-Raviart nonconforming and Raviart-Thomas mixed finite element methods in the Poisson model problem. The three constants and their dependences on some maximal angle in the triangulation are indeed all comparable and allow accurate a priori error control.