Related papers: Adaptive FEM with explicit time integration for th…
Adaptivity and local mesh refinement are crucial for the efficient numerical simulation of wave phenomena in complex geometry. Local mesh refinement, however, can impose a tiny time-step across the entire computational domain when using…
We derive a fully computable aposteriori error estimator for a Galerkin finite element solution of the wave equation with explicit leapfrog time-stepping. Our discrete formulation accommodates both time evolving meshes and leapfrog based…
Local adaptivity and mesh refinement are key to the efficient simulation of wave phenomena in heterogeneous media or complex geometry. Locally refined meshes, however, dictate a small time-step everywhere with a crippling effect on any…
Local time-stepping methods permit to overcome the severe stability constraint on explicit methods caused by local mesh refinement without sacrificing explicitness. In \cite{DiazGrote09}, a leapfrog based explicit local time-stepping…
A posteriori upper and lower bounds are derived for the linear finite element method (FEM) for the Helmholtz equation with large wave number. It is proved rigorously that the standard residual type error estimator seriously underestimates…
This article initiates the study of space-time adaptive mesh refinements for time-dependent boundary element formulations of wave equations. Based on error indicators of residual type, we formulate an adaptive boundary element procedure for…
We establish rigorous \emph{a posteriori} error bounds for a space-time finite element method of arbitrary order discretising linear wave problems in second order formulation. The method combines standard finite elements in space and…
A nonlinear Helmholtz (NLH) equation with high frequencies and corner singularities is discretized by the linear finite element method (FEM). After deriving some wave-number-explicit stability estimates and the singularity decomposition for…
This article investigates residual a posteriori error estimates and adaptive mesh refinements for time-dependent boundary element methods for the wave equation. We obtain reliable estimates for Dirichlet and acoustic boundary conditions…
We consider h-adaptive algorithms in the context of the finite element method (FEM) and the boundary element method (BEM). Under quite general assumptions on the building blocks SOLVE, ESTIMATE, MARK, and REFINE of such algorithms, we prove…
We revisit adaptive time stepping, one of the classical topics of numerical analysis and computational engineering. While widely used in application and subject of many theoretical works, a complete understanding is still missing. Apart…
The convergence analysis for least-squares finite element methods led to various adaptive mesh-refinement strategies: Collective marking algorithms driven by the built-in a posteriori error estimator or an alternative explicit…
Adaptive Finite Element Method (adaptivity) is known to be an effective numerical tool for some ill-posed problems. The key advantage of the adaptivity is the image improvement with local mesh refinements. A rigorous proof of this property…
An adaptive refinement strategy, based on an equilibrated flux a posteriori error estimator, is proposed in the context of defeaturing problems. Defeaturing consists of removing features from complex domains to simplify mesh generation and…
The a posteriori error analysis of the classical Argyris finite element methods dates back to 1996, while the optimal convergence rates of associated adaptive finite element schemes are established only very recently in 2021. It took a long…
The Courant-Friedrichs-Lewy (CFL) condition guarantees the stability of the popular explicit leapfrog method for the wave equation. However, it limits the choice of the time step size to be bounded by the minimal mesh size in the spatial…
We design an adaptive finite element method to approximate the solutions of quasi-linear elliptic problems. The algorithm is based on a Ka\v{c}anov iteration and a mesh adaptation step is performed after each linear solve. The method is…
We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of…
This paper aims to develop an efficient adaptive finite element method for the second-order elliptic problem. Although the theory for adaptive finite element methods based on residual-type a posteriori error estimator and bisection…
Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial…