Related papers: Unified formulation and analysis of mixed and prim…
In this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomial on the mesh…
We review basic design principles underpinning the construction of mimetic finite difference and a few finite volume and finite element schemes for mixed formulations of elliptic problems. For a class of low-order mixed-hybrid schemes, we…
In this work we develop a discretisation method for the Brinkman problem that is uniformly well-behaved in all regimes (as identified by a local dimensionless number with the meaning of a friction coefficient) and supports general meshes as…
In this work, we develop a discretisation method for the mixed formulation of the magnetostatic problem supporting arbitrary orders and polyhedral meshes. The method is based on a global discrete de Rham (DDR) sequence, obtained by patching…
We devise and evaluate numerically Hybrid High-Order (HHO) methods for hyperelastic materials undergoing finite deformations. The HHO methods use as discrete unknowns piecewise polynomials of order $k\ge1$ on the mesh skeleton, together…
We develop a finite element discretization for the weakly symmetric equations of linear elasticity on tetrahedral meshes. The finite element combines, for $r \geq 0$, discontinuous polynomials of $r$ for the displacement,…
This paper aims to improve guaranteed error control for the Stokes problem with a focus on pressure-robustness, i.e. for discretisations that compute a discrete velocity that is independent of the exact pressure. A Prager--Synge type result…
We propose the first optimal geometric multigrid solver for hybrid high-order discretizations that can handle arbitrary polytopal agglomeration hierarchies in both two and three dimensions. The key ingredient is the use of modified skeleton…
This paper derives a discrete dual problem for a prototypical hybrid high-order method for convex minimization problems. The discrete primal and dual problem satisfy a weak convex duality that leads to a priori error estimates with…
In this work we develop a discrete trace theory that spans non-conforming hybrid discretization methods and holds on polytopal meshes. A notion of a discrete trace seminorm is defined, and trace and lifting results with respect to a…
Polytopal methods provide a flexible framework for the numerical approximation of partial differential equations on general meshes. Their convergence analysis raises specific challenges due to their inherently non-conforming nature and, in…
In the discretization of differential problems on complex geometrical domains, discretization methods based on polygonal and polyhedral elements are powerful tools. Adaptive mesh refinement for such kind of problems is very useful as well…
Compatible Discrete Operator schemes preserve basic properties of the continuous model at the discrete level. They combine discrete differential operators that discretize exactly topological laws and discrete Hodge operators that…
We present a new approach to discretizing shape optimization problems that generalizes standard moving mesh methods to higher-order mesh deformations and that is naturally compatible with higher-order finite element discretizations of…
The classical continuous mixed formulation of linear elasticity with pointwise symmetric stresses allows for a conforming finite element discretization with piecewise polynomials of degree at least three. Symmetric stress approximations of…
In this paper we prove a complete panel of consistency results for the discrete de Rham (DDR) complex introduced in the companion paper [D. A. Di Pietro and J. Droniou, An arbitrary-order discrete de Rham complex on polyhedral meshes. Part…
We present a novel and comparative analysis of finite element discretizations for a nonlinear Rosenau-Burgers model including a biharmonic term. We analyze both continuous and mixed finite element approaches, providing stability, existence,…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
In this paper we present a novel arbitrary-order discrete de Rham (DDR) complex on general polyhedral meshes based on the decomposition of polynomial spaces into ranges of vector calculus operators and complements linked to the spaces in…
New interpolation and quasi-interpolation operators of Cl\'ement- and Scott-Zhang-type are analyzed on anisotropic polygonal and polyhedral meshes. Since no reference element is available, an appropriate linear mapping to a reference…