Related papers: Explicit Bound for Quadratic Lagrange Interpolatio…
We introduce remarkable upper bounds for the interpolation error constants on triangles, which are sharp and given by simple formulas. These constants are crucial in analyzing interpolation errors, particularly those associated with the…
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…
The quantitative estimation for the interpolation error constants of the Fujino-Morley interpolation operator is considered. To give concrete upper bounds for the constants, which is reduced to the problem of providing lower bounds for…
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…
An upper bound for the Lebesgue constant (the supremum norm) of the operator of interpolation of a function in equally spaced points of a triangle by a polynomial of total degree less than or equal to n is obtained. Earlier, the rate of…
We prove that a suitably adjusted version of Peter Jones' formula for interpolation by bounded holomorphic functions gives a sharp upper bound for what is known as the constant of interpolation. We show how this leads to precise and…
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…
In this article we study the estimation of bifurcation coefficients in nonlinear branching problems by means of Rayleigh-Ritz approximation to the eigenvectors of the corresponding linearized problem. It is essential that the approximations…
It's well known that in the high-level error bound for multiquadric interpolation there is a crucial constant lambda lying between 0 and 1 which connot be calculated or even approximated. The purpose of this paper is to answer this…
We study in this paper the function approximation error of multivariate linear extrapolation. The sharp error bound of linear interpolation already exists in the literature. However, linear extrapolation is used far more often in…
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…
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)…
Several problems of trigonometric approximation on a hexagon and a triangle are studied using the discrete Fourier transform and orthogonal polynomials of two variables. A discrete Fourier analysis on the regular hexagon is developed in…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
We consider Lagrange interpolation on the set of finitely many intervals. This problem is closely related to the least deviating polynomial from zero on such sets. We will obtain lower and upper estimates for the corresponding Lebesgue…
This paper deals with probabilistic upper bounds for the error in functional estimation defined on some interpolation and extrapolation designs, when the function to estimate is supposed to be analytic. The error pertaining to the estimate…
Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…
One classical measure of the quality of an interpolating function is its Lipschitz constant. In this paper we consider interpolants with additional smoothness requirements, in particular that their derivatives be Lipschitz. We show that…
In this paper we investigate polynomial interpolation using orthogonal polynomials. We use weight functions associated with orthogonal polynomials to define a weighted form of Lagrange interpolation. We introduce an upper bound of error…
In the error analysis of finite element methods, the shape regularity assumption on triangulations is typically imposed to obtain a priori error estimations. In practical computations, however, very thin or degenerated elements that violate…