Related papers: Direct Serendipity and Mixed Finite Elements on Co…
We consider minimization of functions that are compositions of convex or prox-regular functions (possibly extended-valued) with smooth vector functions. A wide variety of important optimization problems fall into this framework. We describe…
We construct finite element de~Rham complexes of higher and possibly non-uniform polynomial order in finite element exterior calculus (FEEC). Starting from the finite element differential complex of lowest-order, known as the complex of…
Although Regge finite element functions are not continuous, useful generalizations of nonlinear derivatives like the curvature, can be defined using them. This paper is devoted to studying the convergence of the finite element lifting of a…
The aim of this paper is to provide new perspectives on the relative finite elements accuracy. Starting from a geometrical interpretation of the error estimate which can be deduced from Bramble-Hilbert lemma, we derive a probability law…
A family of conforming virtual element Hessian complexes on tetrahedral meshes are constructed based on decompositions of polynomial tensor spaces. They are applied to discretize the linearized time-independent Einstein-Bianchi system with…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We present a new direct logarithmically optimal in theory and fast in practice algorithm to implement the high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. The key points…
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 examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…
In this paper, we give a geometric interpretation of optimal functionals in the context of intersection of symmetry planes and cyclic polytopes. For 1D CFTs, we demonstrate that at given derivative order, the functional is given by a…
We consider the lowest--degree nonconforming finite element methods for the approximation of elliptic problems in high dimensions. The $P_1$--nonconforming polyhedral finite element is introduced for any high dimension. Our finite element…
This paper is the first in a series. The main goal of the series is to present a geometric construction of certain remarkable tensor categories arising from quantum groups coresponding to the value of deformation parameter $q$ equal to a…
Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a…
This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The XVEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to…
Meshing of geometric domains having curved boundaries by affine simplices produces a polytopial approximation of those domains. The resulting error in the representation of the domain limits the accuracy of finite element methods based on…
A new field of numerical astrophysics is introduced which addresses the solution of large, multidimensional structural or slowly-evolving problems (rotating stars, interacting binaries, thick advective accretion disks, four dimensional…
Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…
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.
The higher direct image complex of a coherent sheaf (or finite complex of coherent sheaves) under a projective morphism is a fundamental construction that can be defined via a Cech complex or an injective resolution, both inherently…
We study skew-orthogonal polynomials with respect to the weight function $\exp[-2V(x)]$, with $V(x)=\sum_{K=1}^{2d}(u_{K}/{K})x^{K}$, $u_{2d} > 0$, $d > 0$. A finite subsequence of such skew-orthogonal polynomials arising in the study of…