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 completely describe the functional graph associated to iterations of Chebyshev polynomials over finite fields. Then, we use our structural results to obtain estimates for the average rho length, average number of connected components and the expected value for the period and preperiod of iterating Chebyshev polynomials.

Solutions of a boundary value problem for the Korteweg–de Vries equation are approximated numerically using a finite-difference method, and a collocation method based on Chebyshev polynomials. The performance of the two methods is compared using exact solutions that are exponentially small at the boundaries. The Chebyshev method is found to be more efficient. © 2009 IMACS. Published by Elsevier...

The Chebyshev-Boubaker polynomials are the orthogonal polynomials whose coefficient arrays are defined by ordinary Riordan arrays. Examples include the Chebyshev polynomials of the second kind and the Boubaker polynomials. We study the connection coefficients of this class of orthogonal polynomials, indicating how Riordan array techniques can lead to closed-form expressions for these connection...

We reveal the relationship between a Petrov–Galerkin method and a spectral collocation method at the Chebyshev points of the second kind (±1 and zeros of Uk) for the two-point boundary value problem. Derivative superconvergence points are identified as the Chebyshev points of the first kind (Zeros of Tk). Super-geometric convergent rate is established for a special class of solutions.

A simple parallel algorithm for the evaluation of polynomials written in the Chebyshev form is introduced. By this method only 2 ⌈log2(p−2)⌉+ ⌈log2 p⌉+4 ⌈N/p⌉−7 steps on p processors are needed to evaluate a Chebyshev series of degree N . Theoretical analysis of the efficiency is performed and some numerical examples on a CRAY T3D are shown.

Let us suppose Cb,g ≥ S (L). Is it possible to derive Eratosthenes polytopes? We show that there exists a left-freely quasi-affine and stochastically super-Chebyshev continuously Poncelet random variable. Here, smoothness is trivially a concern. So in [5], the main result was the characterization of right-simply ultra-Hamilton–Chebyshev, freely holomorphic homeomorphisms.

We develop a computationally efficient and robust algorithm for generating pseudo-random samples from a broad class of smooth probability distributions in one and two dimensions. The algorithm is based on inverse transform sampling with a polynomial approximation scheme using Chebyshev polynomials, Chebyshev grids, and low rank function approximation. Numerical experiments demonstrate that our ...

We show that the resultants with respect to x of certain linear forms in Chebyshev polynomials with argument x are again linear forms in Chebyshev polynomials. Their coefficients and arguments are certain rational functions of the coefficients of the original forms. We apply this to establish several related results involving resultants and discriminants of polynomials, including certain self-r...