Related papers: Sharp geometric requirements in the Wachspress int…
Interpolation error estimates needed in common finite element applications using simplicial meshes typically impose restrictions on the both the smoothness of the interpolated functions and the shape of the simplices. While the simplest…
The aim of this paper is to show that, for any $p \in [1,\infty)$, the $W^{1,p}$-anisotropic interpolation error estimate holds on quadrilateral isoparametric elements verifying the maximum angle condition ($MAC$) and the property of…
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…
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…
We study $W^{1,p}$ Lagrange interpolation error estimates for general quadrilateral $\mathcal{Q}_{k}$ finite elements with $k\ge 2$. For the most standard case of $p=2$ it turns out that the constant $C$ involved in the error estimate can…
For a tetrahedron, suppose that all internal angles of faces and all dihedral angles are less than a fixed constant $C$ that is smaller than $\pi$. Then, it is said to satisfy the maximum angle condition with the constant $C$. The maximum…
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 -…
We propose a general theory of estimating interpolation error for smooth functions in two and three dimensions. In our theory, the error of interpolation is bound in terms of the diameter of a simplex and a geometric parameter. In the…
The gradient bounds of generalized barycentric coordinates play an essential role in the $H^1$ norm approximation error estimate of generalized barycentric interpolations. Similarly, the $H^k$ norm, $k>1$, estimate needs upper bounds of…
We use $L^2$ estimates for the $\bar\partial$ equation to find geometric conditions on discrete interpolating varieties for weighted spaces $A_p(\C)$ of entire functions such that $| f(z)|\le Ae^{Bp(z)}$ for some $A,B>0$. In particular, we…
This paper describes the analysis of Lagrange interpolation errors on tetrahedrons. In many textbooks, the error analysis of Lagrange interpolation is conducted under geometric assumptions such as shape regularity or the (generalized)…
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 present the error analysis of Lagrange interpolation on triangles. A new \textit{a priori} error estimate is derived in which the bound is expressed in terms of the diameter and circumradius of a triangle. No geometric conditions on…
Given a function f defined on a bidimensional bounded domain and a positive integer N, we study the properties of the triangulation that minimizes the distance between f and its interpolation on the associated finite element space, over all…
We present precise anisotropic interpolation error estimates for smooth functions using a new geometric parameter and derive inverse inequalities on anisotropic meshes. In our theory, the interpolation error is bounded in terms of the…
Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the…
The Performance Estimation Problem methodology makes it possible to determine the exact worst-case performance of an optimization method. In this work, we generalize this framework to first-order methods involving linear operators. This…
We study in this paper the function approximation error of linear interpolation and extrapolation. Several upper bounds are presented along with the conditions under which they are sharp. All results are under the assumptions that the…
This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…
We study those smooth complex hypersurfaces W in C^n having the property that all holomorphic functions of finite weighted L^p norm on W extend to entire functions with finite weighted L^p norm. Such hypersurfaces are called interpolation…