Related papers: Error Estimates for Generalized Barycentric Interp…
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…
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…
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…
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…
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 present a novel barycentric interpolation algorithm designed for analytic functions $f\in\mathcal{A}(E)$ defined on the complex plane. The algorithm, which encompasses both polynomial and rational interpolation, is tailored to handle…
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 introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n…
In this paper, applied strictly monotonic increasing scaled maps, a kind of well-conditioned linear barycentric rational interpolations are proposed to approximate functions of singularities at the origin, such as $x^\alpha$ for $\alpha \in…
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…
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…
Consider the Poisson equation with the Dirichlet boundary condition on a three-dimensional polyhedral domain. For singular solutions from the non-smoothness of the domain boundary, we propose new anisotropic tetrahedral mesh refinement…
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…
We propose an adaptive polygonal finite element formulation for collapse plastic analysis of solids. The article contributes into four crucial points: 1) Wachspress shape functions at vertex and bubble nodes handled at a primal-mesh level;…
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…
The convergence rates on polynomial interpolation in most cases are estimated by Lebesgue constants. These estimates may be overestimated for some special points of sets for functions of limited regularities. In this paper, by applying the…
We consider interpolation of univariate functions on arbitrary sets of nodes by Gaussian radial basis functions or by exponential functions. We derive closed-form expressions for the interpolation error based on the…
In this paper, we propose a novel dual-based Lawson's method, termed {b-d-Lawson}, designed for addressing the rational minimax approximation under specific interpolation conditions. The {b-d-Lawson} approach incorporates two pivotal…
We develop new methods for approximating conformal blocks as positive functions times polynomials, with applications to the numerical bootstrap. We argue that to obtain accurate bootstrap bounds, conformal block approximations should…
For the Lagrange interpolation over a triangular domain, we propose an efficient algorithm to rigorously evaluate the interpolation error constant under the maximum norm by using the finite element method (FEM). In solving the optimization…