60,316 research outputs found
Adaptive boundary element methods with convergence rates
This paper presents adaptive boundary element methods for positive, negative,
as well as zero order operator equations, together with proofs that they
converge at certain rates. The convergence rates are quasi-optimal in a certain
sense under mild assumptions that are analogous to what is typically assumed in
the theory of adaptive finite element methods. In particular, no
saturation-type assumption is used. The main ingredients of the proof that
constitute new findings are some results on a posteriori error estimates for
boundary element methods, and an inverse-type inequality involving boundary
integral operators on locally refined finite element spaces.Comment: 48 pages. A journal version. The previous version (v3) is a bit
lengthie
Uniform Convergence of Adaptive Multigrid Methods for Elliptic Problems and Maxwell's Equations
We consider the convergence theory of adaptive multigrid methods for second-order elliptic problems and Maxwell's equations. The multigrid algorithm only performs pointwise Gauss-Seidel relaxations on new degrees of freedom and their "immediate” neighbors. In the context of lowest order conforming finite element approximations, we present a unified proof for the convergence of adaptive multigrid V-cycle algorithms. The theory applies to any hierarchical tetrahedral meshes with uniformly bounded shape-regularity measures. The convergence rates for both problems are uniform with respect to the number of mesh levels and the number of degrees of freedom. We demonstrate our convergence theory by two numerical experiment
On a general implementation of - and -adaptive curl-conforming finite elements
Edge (or N\'ed\'elec) finite elements are theoretically sound and widely used
by the computational electromagnetics community. However, its implementation,
specially for high order methods, is not trivial, since it involves many
technicalities that are not properly described in the literature. To fill this
gap, we provide a comprehensive description of a general implementation of edge
elements of first kind within the scientific software project FEMPAR. We cover
into detail how to implement arbitrary order (i.e., -adaptive) elements on
hexahedral and tetrahedral meshes. First, we set the three classical
ingredients of the finite element definition by Ciarlet, both in the reference
and the physical space: cell topologies, polynomial spaces and moments. With
these ingredients, shape functions are automatically implemented by defining a
judiciously chosen polynomial pre-basis that spans the local finite element
space combined with a change of basis to automatically obtain a canonical basis
with respect to the moments at hand. Next, we discuss global finite element
spaces putting emphasis on the construction of global shape functions through
oriented meshes, appropriate geometrical mappings, and equivalence classes of
moments, in order to preserve the inter-element continuity of tangential
components of the magnetic field. Finally, we extend the proposed methodology
to generate global curl-conforming spaces on non-conforming hierarchically
refined (i.e., -adaptive) meshes with arbitrary order finite elements.
Numerical results include experimental convergence rates to test the proposed
implementation
Convergence rates for adaptive finite elements
In this article we prove that it is possible to construct, using
newest-vertex bisection, meshes that equidistribute the error in -norm,
whenever the function to approximate can be decomposed as a sum of a regular
part plus a singular part with singularities around a finite number of points.
This decomposition is usual in regularity results of Partial Differential
Equations (PDE). As a consequence, the meshes turn out to be quasi-optimal, and
convergence rates for adaptive finite element methods (AFEM) using Lagrange
finite elements of any polynomial degree are obtained
- …