Related papers: Discrete Hessian complexes in three dimensions
We present a space-time virtual element method for the discretization of the heat equation, which is defined on general prismatic meshes and variable degrees of accuracy. Strategies to handle efficiently the space-time mesh structure are…
We report the formation of a binary crystal of hard polyhedra due solely to entropic forces. Although the alternating arrangement of octahedra and tetrahedra is a known space-tessellation, it had not previously been observed in…
This paper is to prove superconvergence of a family of simple conforming mixed finite elements of first orderfor the linear elasticity problem with the Hellinger--Reissner variational formulation. The analysis is based on three main…
A covariant algorithm for deriving the conserved quantities for natural Hamiltonian systems is combined with the non-relativistic framework of Eisenhart, and of Duval, in which the classical trajectories arise as geodesics in a higher…
We construct new families of direct serendipity and direct mixed finite elements on general planer convex polygons that are $H^1$ and $H(div)$ conforming, respectively, and possess optimal order of accuracy for any order. They have a…
The aim of this paper is to develop a virtual element method (VEM) for the vibration problem of thin plates on polygonal meshes. We consider a variational formulation relying only on the transverse displacement of the plate and propose an…
We discuss a system of third order PDEs for strictly convex smooth functions on domains of Euclidean space. We argue that it may be understood as a closure of sorts of the first order prolongation of a family of second order PDEs. We…
We investigate a finite element discretization of an elastic bending-plate model with an effective prestrain. The model has been obtained via homogenization and dimension reduction by B\"onlein at al. (2023). Its energy functional is the…
An algebra isomorphism between algebras of matrices and difference operators is used to investigate the discrete integrable hierarchy. We find local and non-local families of R-matrix solutions to the modified Yang-Baxter equation. The…
We present a new framework for expressing finite element methods on multiple intersecting meshes: multimesh finite element methods. The framework enables the use of separate meshes to discretize parts of a computational domain that are…
I propose a scheme of constructing classical integrable models in 3+1 discrete dimensions, based on a relaxed version of the problem of factorizing a matrix into the product of four matrices of a special form.
Adaptive mesh refinement is a key component of efficient unstructured space-time finite element methods. Underlying any adaptive mesh refinement scheme is, of course, a method for local refinement of simplices. However, simplex bisection…
A systematic study of deformations of four-dimensional Einsteinian space-times embedded in a pseudo-Euclidean space $E^N$ of higher dimension is presented. Infinitesimal deformations, seen as vector fields in $E^N$, can be divided in two…
Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
A novel meshing scheme, based on regular tetra-kai-decahedron, also referred to as truncated octahedron, cells is presented for use in spatial topology optimization. A tetra-kai-decahedron mesh ensures face connectivity between elements…
In this work we analyze a virtual element method on polyhedral meshes for solving the sixth-order elliptic problem with simply supported boundary conditions. We apply the Ciarlet-Raviart arguments to introduce an auxiliary unknown…
Borradaile et al. (2017) investigated orientations of an undirected graph in which the sequence of in-degrees of the nodes is lexicographically minimal, which we call decreasingly minimal (=dec-min). They proved that an orientation is…
Tetrahedral frame fields have applications to certain classes of nematic liquid crystals and frustrated media. We consider the problem of constructing a tetrahedral frame field in three dimensional domains in which the boundary normal…
We present a collection of algorithms which utilize dimensional reduction to perform mesh refinement and study possibly singular solutions of time-dependent partial differential equations. The algorithms are inspired by constructions used…