相关论文: A serendipity fully discrete div-div complex on po…
Recovered finite element methods (R-FEM) have been recently introduced for meshes consisting of simplicial and/or box-type meshes. Here, utilising the flexibility of R-FEM framework, we extend their definition on polygonal and polyhedral…
This paper introduces discrete differential form spaces over two-dimensional manifold meshes that feature enhanced subdivision-induced inter-element regularity compared to conventional finite element (FE) spaces. This increase in smoothness…
A new dimension reduction (DR) method for data sets is proposed by autonomous deforming of data manifolds. The deformation is guided by the proposed deforming vector field, which is defined by two kinds of virtual interactions between data…
We study the number of degrees of freedom (DOFs) in quadratic scalar-nonmetricity (QSN) theory, whose Lagrangian is the linear combination of five quadratic nonmetricity invariants with coefficients depending on a dynamical scalar field.…
The Discrete Morse Theory of Forman appeared to be useful for providing filtration-preserving reductions of complexes in the study of persistent homology. So far, the algorithms computing discrete Morse matchings have only been used for…
We examine the dimensions of various inf-sup stable mixed finite element spaces on tetrahedral meshes in 3D with exact divergence constraints. More precisely, we compare the standard Scott-Vogelius elements of higher polynomial degree and…
In the field of solving partial differential equations (PDEs), Hilbert complexes have become highly significant. Recent advances focus on creating new complexes using the Bernstein-Gelfand-Gelfand (BGG) framework, as shown by Arnold and Hu…
In this work we develop a novel fully discrete version of the plates complex, an exact Hilbert complex relevant for the mixed formulation of fourth-order problems. The derivation of the discrete complex follows the discrete de Rham…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
In this work we address the problem of finding serendipity versions of approximate de Rham complexes with enhanced regularity. The starting point is a new abstract construction of general scope which, given three complexes linked by…
We consider isogeometric discretizations of the Poisson model problem, focusing on high polynomial degrees and strong hierarchical refinements. We derive a posteriori error estimates by equilibrated fluxes, i.e., vector-valued mapped…
The present paper has two objectives. On one side, we develop and test numerically divergence free Virtual Elements in three dimensions, for variable ``polynomial'' order. These are the natural extension of the two-dimensional divergence…
The variational discrete element method developed in [28] for dynamic elasto-plastic computations is adapted to compute the deformation of elastic Cosserat materials. In addition to cellwise displacement degrees of freedom (dofs), cellwise…
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
In this study, two-dimensional finite element complexes with various levels of smoothness, including the de Rham complex, the curldiv complex, the elasticity complex, and the divdiv complex, are systematically constructed. Smooth scalar…
We construct 2D and 3D finite element de Rham sequences of arbitrary polynomial degrees with extra smoothness. Some of these elements have nodal degrees of freedom (DoFs) and can be considered as generalisations of scalar Hermite and…
In this paper, we construct discrete versions of some Bernstein-Gelfand-Gelfand (BGG) complexes, i.e., the Hessian and the divdiv complexes, on triangulations in 2D and 3D. The sequences consist of finite elements with local polynomial…
This paper introduces a novel method for the efficient second-order accurate computation of normal fields from volume fractions on unstructured polyhedral meshes. Locally, i.e. in each mesh cell, an averaged normal is reconstructed by…
Discrete exterior calculus offers a coordinate--free discretization of exterior calculus especially suited for computations on meshes over curved manifolds. The discretization of the wedge product, that would be compatible with discrete…
Compatible schemes localize degrees of freedom according to the physical nature of the underlying fields and operate a clear distinction between topological laws and closure relations. For elliptic problems, the cornerstone in the scheme…