相关论文: Fully discrete polynomial de Rham sequences of arb…
Finite volume methods for problems involving second order operators with full diffusion matrix can be used thanks to the definition of a discrete gradient for piecewise constant functions on unstructured meshes satisfying an orthogonality…
The classical serendipity and mixed finite element spaces suffer from poor approximation on nondegenerate, convex quadrilaterals. In this paper, we develop $\textit{direct serendipity}$ and $\textit{direct mixed}$ finite element spaces,…
We construct conforming finite element elasticity complexes on the Alfeld splits of tetrahedra. The complex consists of vector fields and symmetric tensor fields, interlinked via the linearized deformation operator, the linearized curvature…
We analyze adaptive mesh-refining algorithms for conforming finite element discretizations of certain non-linear second-order partial differential equations. We allow continuous polynomials of arbitrary, but fixed polynomial order. The…
This paper discusses the construction of local bounded commuting projections for discrete subcomplexes of the gradgrad complexes in two and three dimensions, which play an important role in the finite element theory of elasticity (2D) and…
Given a sequence of finite element spaces which form a de Rham sequence, we will construct a dual representation of these spaces with associated differential operators which connect these spaces such that they also form a de Rham sequence.…
We propose a new stable variational formulation for the quad-div problem in three dimensions and prove its well-posedness. Using this weak form, we develop and analyze the $\boldsymbol{H}(\operatorname{grad-div})$-conforming virtual element…
The objective of this article is to address the discretisation of fractured/faulted poromechanical models using 3D polyhedral meshes in order to cope with the geometrical complexity of faulted geological models. A polytopal scheme is…
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 paper we prove the discrete compactness property for a wide class of p-version finite element approximations of non-elliptic variational eigenvalue problems in two and three space dimensions. In a very general framework, we find…
We present a class of discretisation spaces and H(div)-conformal elements that can be built on any polytope. Bridging the flexibility of the Virtual Element spaces towards the element's shape with the divergence properties of the…
Developing efficient numerical algorithms for the solution of high dimensional random Partial Differential Equations (PDEs) has been a challenging task due to the well-known curse of dimensionality. We present a new solution framework for…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We propose a general algorithm for non-conforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on h-refinement with a fixed polynomial order. The algorithm handles triangular,…
Given a domain $\Omega \subset \mathbb{R}^n$, the de Rham complex of differential forms arises naturally in the study of problems in electromagnetism and fluid mechanics defined on $\Omega$, and its discretization helps build stable…
This paper introduces discrete-holomorphic Perfectly Matched Layers (PMLs) specifically designed for high-order finite difference (FD) discretizations of the scalar wave equation. In contrast to standard PDE-based PMLs, the proposed method…
We revisit classical Virtual Element approximations on polygonal and polyhedral decompositions. We also recall the treatment proposed for dealing with decompositions into polygons with curved edges. In the second part of the paper we…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
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,…
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…