Related papers: On Interpolation Approximation: Convergence rates …
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…
In this paper, we study the optimal general convergence rates for quadratures derived from Chebyshev points. By building on the aliasing errors on integration of Chebyshev polynomials, together with the asymptotic formulae on the…
We consider regular polynomial interpolation algorithms on recursively defined sets of interpolation points which approximate global solutions of arbitrary well-posed systems of linear partial differential equations. Convergence of the…
Based on the Hilb type formula between Jacobi polynomials and Bessel functions, optimal decay rates on Jacobi expansion coefficients are derived, by applying van der Corput type lemmas, for functions of logarithmatic singularities, which…
This paper is concerned with Lagrange interpolation by total degree polynomials in moderate dimensions. In particular, we are interested in characterising the optimal choice of points for the interpolation problem, where we define the…
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…
Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…
As one myth of polynomial interpolation and quadrature, Trefethen [30] revealed that the Chebyshev interpolation of $|x-a|$ (with $|a|<1 $) at the Clenshaw-Curtis points exhibited a much smaller error than the best polynomial approximation…
This paper is devoted to a rigorous analysis of exponential convergence of polynomial interpolation and spectral differentiation based on the Gegenbauer-Gauss and Gegenbauer-Gauss-Lobatto points, when the underlying function is analytic on…
To analyze the absolute condition number of multivariate polynomial interpolation on Lissajous-Chebyshev node points, we derive upper and lower bounds for the respective Lebesgue constant. The proof is based on a relation between the…
The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there…
We estimate the Lebesgue constants for Lagrange interpolation processes on one or several intervals by rational functions with fixed poles. We admit that the poles have accumulation points on the intervals. To prove it we use an analog of…
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
We revisit the approximation of nonempty compact planar sets by filled-in Julia sets of polynomials developed by Lindsey and Younsi and analyze the rate of approximation. We use slightly modified fundamental Lagrange interpolation…
In this work, we study superconvergence properties for some high-order orthogonal polynomial interpolations.The results are two-folds: When interpolating function values, we identify those points where the first and second derivatives of…
We study the optimal general rate of convergence of the n-point quadrature rules of Gauss and Clenshaw-Curtis when applied to functions of limited regularity: if the Chebyshev coefficients decay at a rate O(n^{-s-1}) for some s > 0,…
The study of interpolation nodes and their associated Lebesgue constants are central to numerical analysis, impacting the stability and accuracy of polynomial approximations. In this paper, we will explore the Morrow-Patterson points, a set…
This article is devoted to developing a theory for effective kernel interpolation and approximation in a general setting. For a wide class of compact, connected $C^\infty$ Riemannian manifolds, including the important cases of spheres and…
The interpolation-regression approximation is a powerful tool in numerical analysis for reconstructing functions defined on square or triangular domains from their evaluations at a regular set of nodes. The importance of this technique lies…
In this paper, superconvergence points are located for the approximation of the Riesz derivative of order $\alpha$ using classical Lobatto-type polynomials when $\alpha \in (0,1)$ and generalized Jacobi functions (GJF) for arbitrary $\alpha…