Related papers: Upper bound of high-order derivatives for Wachspre…
We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…
We prove the optimal convergence estimate for first order interpolants used in finite element methods based on three major approaches for generalizing barycentric interpolation functions to convex planar polygonal domains. The Wachspress…
This work derives a posteriori error estimate of polygonal finite element methods based on Wachspress barycentric coordinates. In particular, we prove that the classical residual-based a posteriori error estimator is both an upper and lower…
We propose a novel theoretical framework for barycentric interpolation, using concepts recently developed in mathematical physics. Generalized barycentric coordinates are defined similarly to Shepard's method, using positive geometries -…
This paper describes a novel construction of generalized barycentric coordinates of points on a sphere with respect to the vertices of a given spherical polygon that is contained in a common hemisphere. While in the standard approach such…
In a similar fashion to estimates shown for Harmonic, Wachspress, and Sibson coordinates in [Gillette et al., AiCM, doi:10.1007/s10444-011-9218-z], we prove interpolation error estimates for the mean value coordinates on convex polygons…
Geometric conditions on general polygons are given in [9] in order to guarantee the error estimate for interpolants built from generalized barycentric coordinates, and the question about identifying sharp geometric restrictions in this…
We provide error bounds on the traces and norms of the derivative of the $L^2$ projection of an $H^{k}$ function onto the space of polynomials of degree $\leq p$. The bounds are explicit in the order of differentiation and the polynomial…
Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
We show that there is a unique hypersurface of minimal degree passing through the non-faces of a polytope which is defined by a simple hyperplane arrangement. This generalizes the construction of the adjoint curve of a polygon by Wachspress…
We study the problem of estimating the barycenter of a distribution given i.i.d. data in a geodesic space. Assuming an upper curvature bound in Alexandrov's sense and a support condition ensuring the strong geodesic convexity of the…
We present a numerical method for rigorous over-approximation of a reachable set of differential inclusions. The method gives high-order error bounds for single step approximations and a uniform bound on the error over the finite time…
We obtain upper bounds for the norm of the Schwarzian derivative of convex holomorphic mappings defined on the polydisk and the unit ball in $\mathbb{C}^n$. For coordinate-wise convex mappings on the polydisk, we derive a sharp estimate…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
This article deals with error estimates for the finite element approximation of variational normal derivatives and, as a consequence, error estimates for the finite element approximation of Dirichlet boundary control problems with energy…
This paper is concerned with approximations and related discretization error estimates for the normal derivatives of solutions of linear elliptic partial differential equations. In order to illustrate the ideas, we consider the Poisson…
We study first order methods to compute the barycenter of a probability distribution $P$ over the space of probability measures with finite second moment. We develop a framework to derive global rates of convergence for both gradient…
Motivated by problems on random differences in Szemer\'{e}di's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the…
Let P_d be a convex polygon with d vertices. The associated Wachspress surface W_d is a fundamental object in approximation theory, defined as the image of the rational map w_d from P^2 to P^{d-1}, determined by the Wachspress barycentric…