We propose a novel method for studying the production of anticentauro events in high energy heavy ion collisions utilizing Chebyshev expansion coefficients. These coefficients have proved to be very efficient in investigating the pattern of fluctuations in neutral pion fraction. For the anticentauro like events, the magnitude of first few coefficients is strongly enhanced (≈3 times) as compared...

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

The problem of crack propagation along the interface of two bonded dissimilar orthotropic plates is considered. Using Galilean transformation, the problem is reduced to a quasistatic one. Then, using Fourier transforms and asymptotic analysis, the problem is reduced to a pair of singular integral equations with Cauchy-type singularity. These equations are solved using Gauss-Chebyshev quadrature...

We give an alternative proof to the well known fact that each convex compact centrally symmetric subset of R2 containing the origin is a zonoid, i.e., the range of a two dimensional vector measure, and we prove that a two dimensional zonoid whose boundary contains the origin is strictly convex if and only if it is the range of a Chebyshev measure. We give a condition under which a two dimension...

Given a polynomial φ(x) and a finite field Fq one can construct a directed graph where the vertices are the values in the finite field, and emanating from each vertex is an edge joining the vertex to its image under φ. When φ is a Chebyshev polynomial of prime degree, the graphs display an unusual degree of symmetry. In this paper we provide a complete description of these graphs, and then use ...

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

The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre poly...

We obtain a property which characterizes the Chebyshev orthogonal polynomials of first, second, third, and fourth kind. Indeed, we prove that the four Chebyshev sequences are the unique classical orthogonal polynomial families such that their linear combinations, with fixed length and constant coefficients, can be orthogonal polynomial sequences. 1. Introduction The classical orthogonal polynom...