Related papers: An hp-adaptive strategy for elliptic problems
In this work, an adaptive edge element method is developed for an H(curl)-elliptic constrained optimal control problem. We use the lowest-order Nedelec's edge elements of first family and the piecewise (element-wise) constant functions to…
In \cite{liu2022practical}, a general algorithm is developed to efficiently obtain the best accuracy using the regular refinement. The adaptive refinement allows for obtaining an accuracy with a smaller number of DoFs compared with the…
Recovery type a posteriori error estimators are popular, particularly in the engineering community, for their computationally inexpensive, easy to implement, and generally asymptotically exactness. Unlike the residual type error estimators,…
This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The…
In this paper, we study adaptive finite element approximations in a perturbation framework, which makes use of the existing adaptive finite element analysis of a linear symmetric elliptic problem. We prove the convergence and complexity of…
In this work, we investigate the numerical reconstruction of inclusions in a semilinear elliptic equation arising in the mathematical modeling of cardiac ischemia. We propose an adaptive finite element method for the resulting constrained…
The paper is concerned with the adaptive finite element solution of linear elliptic differential equations using equidistributing meshes. A strategy is developed for defining this type of mesh based on residual-based a posteriori error…
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…
We present a modification to the Berger and Oliger adaptive mesh refinement algorithm designed to solve systems of coupled, non-linear, hyperbolic and elliptic partial differential equations. Such systems typically arise during constrained…
A numerical method is developed to solve linear semi-infinite programming problem (LSIP) in which the iterates produced by the algorithm are feasible for the original problem. This is achieved by constructing a sequence of standard linear…
We discuss the $p$- and the $hp$-versions of the virtual element method for the approximation of eigenpairs of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr\"odinger…
In this article we propose a new adaptive numerical quadrature procedure which includes both local subdivision of the integration domain, as well as local variation of the number of quadrature points employed on each subinterval. In this…
This article considers a model problem of elastoplasticity with linearly kinematic hardening and presents hp-finite element discretizations of two equivalent weak formulations each having their respective advantages. A mixed variational…
We consider adaptive finite element methods for second-order elliptic PDEs, where the arising discrete systems are not solved exactly. For contractive iterative solvers, we formulate an adaptive algorithm which monitors and steers the…
We present numerical experiments for geophysics electromagnetic (EM) modeling based upon high-order edge elements and supervised $h+p$ refinement approaches on massively parallel computers. Our high-order $h+p$ refinement strategy is based…
We introduce generalised finite difference methods for solving fully nonlinear elliptic partial differential equations. Methods are based on piecewise Cartesian meshes augmented by additional points along the boundary. This allows for…
Localized features such as singularities, sharp gradients, discontinuities, and moving sources require adaptive finite element discretizations. Conventional refinement strategies introduce significant computational overhead through…
We establish the existence of liftings into discrete subspaces of $\mathbf{H}(\mathrm{div})$ of piecewise polynomial data on locally refined simplicial partitions of polygonal/polyhedral domains. Our liftings are robust with respect to the…
This work is devoted to the development and analysis of a linearization algorithm for microscopic elliptic equations, with scaled degenerate production, posed in a perforated medium and constrained by the homogeneous Neumann-Dirichlet…
This work develops polynomial-degree-robust (p-robust) equilibrated a posteriori error estimates for $H(\rm curl)$, $H(\rm div)$ and $H(\rm divdiv)$ problems, based on $H^1$ auxiliary space decomposition. The proposed framework employs…