On the filtered polynomial interpolation at Chebyshev nodes
نویسندگان
چکیده
The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vallée Poussin filters. In order to get an optimal in spaces of locally continuous functions equipped weighted uniform norms, the related Lebesgue constants have be uniformly bounded. previous works this has already been proved under different sufficient conditions. Here, we complete study stating also necessary conditions it. Several numerical experiments are given test theoretical results and make comparisons Lagrange same nodes.
منابع مشابه
Multivariate polynomial interpolation on Lissajous-Chebyshev nodes
In this contribution, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets linked to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation nodes related to these curves, we derive a discrete orthogonality structure on these node sets. Using this discrete orthogonality structure, we can deriv...
متن کاملBivariate Lagrange Interpolation at the Chebyshev Nodes
We discuss Lagrange interpolation on two sets of nodes in two dimensions where the coordinates of the nodes are Chebyshev points having either the same or opposite parity. We use a formula of Xu for Lagrange polynomials to obtain a general interpolation theorem for bivariate polynomials at either set of Chebyshev nodes. An extra term must be added to the interpolation formula to handle all poly...
متن کاملBivariate Polynomial Interpolation at the Geronimus Nodes
We consider a class of orthogonal polynomials that satisfy a threeterm recurrence formula with constant coefficients. This class contains the Geronimus class and, in particular, all four kinds of the Chebyshev polynomials. There are alternation points for each of these orthogonal polynomials that have a special compatibility with the polynomials of lower index. These points are the coordinates ...
متن کاملA polynomial interpolation process at quasi-Chebyshev nodes with the FFT
Interpolation polynomial pn at the Chebyshev nodes cosπj/n (0 ≤ j ≤ n) for smooth functions is known to converge fast as n → ∞. The sequence {pn} is constructed recursively and efficiently in O(n log2 n) flops for each pn by using the FFT, where n is increased geometrically, n = 2i (i = 2, 3, . . . ), until an estimated error is within a given tolerance of ε. This sequence {2j}, however, grows ...
متن کاملOn Hermite-fejer Type Interpolation on the Chebyshev Nodes
ON HERMITE-FEJER TYPE INTERPOLATION ON THE CHEBYSHEV NODES GRAEME J. BYRNE, T.M. MILLS AND SIMON J. SMITH Given / £ C[-l, 1], let Hn,3(f,x) denote the (0,1,2) Hermite-Fejer interpolation polynomial of / based on the Chebyshev nodes. In this paper we develop a precise estimate for the magnitude of the approximation error |£Tn,s(/,x) — f(x)\. Further, we demonstrate a method of combining the dive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2021
ISSN: ['1873-5460', '0168-9274']
DOI: https://doi.org/10.1016/j.apnum.2021.04.013