65N12 Stability and convergence of numerical methods
Refine
Language
- English (7)
Keywords
- AFEM (2)
- convergence (2)
- finite element method (2)
- AMFEM (1)
- Crouzeix-Raviart (1)
- Raviart-Thomas (1)
- Signorini contact (1)
- Tresca friction (1)
- a priori error analysis (1)
- a priori error estimate (1)
Application Area
- C (6)
The analysis of adaptive finite element methods in practice immediately leads to eigenvalue clusters which requires the simultaneous marking in adaptive finite element methods. A first analysis for multiple eigenvalues of the recent work [Dai, He, Zhou, arXiv Preprint 1210.1846v2] introduces an adaptive method whose marking strategy is based on the element-wise sum of local error estimator contributions for multiple eigenvalues. This paper proves optimality of a practical adaptive algorithm for eigenvalue clusters for the eigenvalues of the Laplace operator in terms of nonlinear approximation classes. All estimates are explicit in the initial mesh-size, the eigenvalues and the cluster width to clarify the dependence of the involved constants.
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coeffcient functions. For this purpose we construct a generalized finite element basis that spans a low dimensional multiscale space. The basis is assembled by performing localized linear finescale computations in small patches that have a diameter of order H |log(H)| where H is the coarse mesh size. Without any assumptions on the type of the oscillations in the coeffcients, we give a rigorous proof for a linear convergence of the H1-error with respect to the coarse mesh
size. To solve the arising equations, we propose an algorithm that is based on a damped Newton scheme in the multiscale space.
Global spatial regularity for elasticity models with cracks, contact and other nonsmooth constraints
(2012)
A global higher differentiability result in Besov
spaces is proved for the displacement fields of linear elastic models
with self contact.
Domains with cracks are studied, where nonpenetration
conditions/Signorini conditions are imposed on the crack faces.
It is shown that
in a neighborhood of crack tips (in 2D) or
crack fronts (3D) the displacement fields are
$B^{3/2}_{2,\infty}$ regular.
The proof relies on a difference
quotient argument for the directions tangential to the crack. In order
to obtain the regularity estimates also in the normal direction, an
argument due to
Ebmeyer/Frehse/Kassmann is modified.
The methods are then applied to further examples like
contact problems with nonsmooth rigid foundations, to a model with
Tresca friction and
to minimization problems with
nonsmooth energies and constraints as they occur for instance in the modeling of
shape memory alloys.
Based on Falk's approximation Theorem for variational
inequalities, convergence rates for FE-discretizations of contact
problems are derived relying on the proven regularity properties.
Several numerical examples illustrate the theoretical results.
This paper establishes the equivalence of conforming Courant finite element method and nonconforming Crouzeix-Raviart finite element method in the sense that the respective energy error norms are equivalent up to generic constants and higher-order data oscillations in a Poisson model problem. The Raviart-Thomas mixed finite element method is better than the previous two whereas the conjecture of the converse relation is proved to be false.
This paper completes the analysis of comparison initiated by Braess in Calcolo (2010). Two numerical benchmarks illustrate the comparison theorems and the possible strict superiority of the Raviart-Thomas mixed finite element method. Applications include least-squares finite element methods and equality of approximation classes for concepts of optimality for adaptive finite element methods.
This note constructs a local generalized finite element basis for elliptic problems with heterogeneous and highly varying diffusion tensor. The basis functions are solutions of local problems on vertex patches. The error of the corresponding generalized finite element method decays exponentially w.r.t. the number of element layers in the patches. Hence, on a uniform mesh of size H, patches of diameter log(1/H) are sufficient to preserve the convergence rates of the classical P1-FEM for the Poisson problem.
The analysis does not rely on regularity of the solution or scale separation in the coefficient.
The result justifies the use of the class of variational multiscale methods, introduced in [Comput. Methods Appl. Mech. Engrg., 196:2313--2324, 2007].
Various applications in fluid dynamics and computational continuum mechanics motivate the development of reliable and efficient adaptive algorithms for mixed finite element methods. In order to save degrees of freedom, not all but just some selected set of finite element domains are refined. Hence the fundamental question of convergence as well as the question of optimality require new mathematical arguments. The presented adaptive algorithm for Raviart-Thomas mixed finite element methods solves the Poisson model problem, with optimal convergence rate.
Chen, Holst, and Xu presented "convergence and optimality of adaptive mixed finite element methods" (2008) following arguments of Rob Stevenson for the conforming finite element method. Their algorithm reduces oscillations separately, before approximating the solution by some adaptive algorithm in the spirit of W. Dörfler (1996). The algorithm proposed here appears more natural in switching to either reduction of the edge-error estimator or of the oscillations.
A refined a posteriori error analysis for symmetric eigenvalue problems and the convergence of the first-order adaptive finite element method (AFEM) is presented. The $H^1$ stability of the $L^2$ projection provides reliability and efficiency of the edge-contribution of standard residual-based error estimators for $P_1$ finite element methods. In fact, the volume contributions and even oscillations can be omitted for Courant finite element methods. This allows for a refined averaging scheme and so improves [Dong Mao, Lihua Shen and Aihui Zhou, Adaptive finite element algorithms for eigenvalue problems based on local averaging type a posteriori error estimates, Advanced in Computational Mathematics, 2006, 25: 135-160]. The proposed AFEM
monitors the edge-contributions in a bulk criterion and so enables a contraction property up to higher-order terms and global convergence. Numerical experiments exploit the remaining $L^2$ error contributions and confirm our theoretical findings. The averaging schemes show a high accuracy and the AFEM leads to optimal empirical convergence rates.