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...

8 In his paper " Lagrange interpolation on Chebyshev points of two variables " (J. 9 220–238), Y. Xu proposed a set of Chebyshev like points for polynomial interpolation in the square 10 [−1, 1] 2 , and derived a compact form of the corresponding Lagrange interpolation formula. We inves-11 tigate computational aspects of the Xu polynomial interpolation formula like numerical stability and 12 ef...

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...

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...

Digital architectures for Chebyshev interpolation are explored and a variation which is word-serial in nature is proposed. These architectures are contrasted with equispaced system structures. Further, Chebyshev interpolation scheme is compared to the conventional equispaced interpolation vis-á-vis reconstruction error and relative number of samples. It is also shown that the use of a hybrid (o...

This paper improves error bounds for Gauss, Clenshaw-Curtis and Fejér’s first quadrature by using new error estimates for polynomial interpolation in Chebyshev points. We also derive convergence rates of Chebyshev interpolation polynomials of the first and second kind for numerical evaluation of highly oscillatory integrals. Preliminary numerical results show that the improved error bounds are ...

We solve a recent conjecture, proving that the Lebesgue constant of Chebyshev-like angular nodes for trigonometric interpolation on a subinterval [−ω, ω] of the full period [−π, π] is attained at ±ω, its value is independent of ω and coincides with the Lebesgue constant of algebraic interpolation at the classical Chebyshev nodes in (−1, 1). 2000 AMS subject classification: 42A15, 65T40.

We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the pap...

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 is the mock-Chebyshev interpolation which is an interpolation made on a subset of the given nodes which elements mimic as well as possible the Chebyshev-Loba...

This paper reviews the notion of interpolation of a smooth function by means of Chebyshev polynomials, and the well-known associated results of spectral accuracy when the function is analytic. The rate of decay of the error is proportional to ρ−N , where ρ is a bound on the elliptical radius of the ellipse in which the function has a holomorphic extension. An additional theorem is provided to c...