We provide an algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with complex poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the c...

Chebyshev polynomials of the first and the second kind in n variables z. , Zt , ... , z„ are introduced. The variables z, , z-,..... z„ are the characters of the representations of SL(n + 1, C) corresponding to the fundamental weights. The Chebyshev polynomials are eigenpolynomials of a second order linear partial differential operator which is in fact the radial part of the Laplace-Beltrami op...

A prescription for constructing dictionaries for cardinal spline spaces on a compact interval is provided. It is proved that such spaces can be spanned by dictionaries which are built by translating a prototype B-spline function of fixed support into the knots of the required cardinal spline space. This implies that cardinal spline spaces on a compact interval can be spanned by dictionaries of ...

Riordan matrix methods and properties of generating functions are used to prove that the entries of two Catalan-type Riordan arrays are linked to the Chebyshev polynomials of the first kind. The connections are that the rows of the arrays are used to expand the monomials (1/2) (2x) and (1/2) (4x) in terms of certain Chebyshev polynomials of degree n. In addition, we find new integral representa...

Efficient direct solvers based on the Chebyshev-Galerkin methods for second and fourth order equations are presented. They are based on appropriate base functions for the Galerkin formulation which lead to discrete systems with special structured matrices which can be efficiently inverted. Numerical results indicate that the direct solvers presented in this paper are significantly more accurate...

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

In this short note, we give simple proofs of several results and conjectures formulated by Stolarsky and Tran concerning generating functions of some families of Chebyshev-like polynomials.