We evaluate explicitly the integrals ∫ 1 −1 πn(t)/(r ∓ t)dt, |r| = 1, with the πn being any one of the four Chebyshev polynomials of degree n. These integrals are subsequently used in order to obtain error bounds for interpolatory quadrature formulae with Chebyshev abscissae, when the function to be integrated is analytic in a domain containing [−1, 1] in its interior.

Three theorems are given for the integral zeros of Krawtchouk polynomials. First, five new infinite families of integral zeros for the binary (q = 2) Krawtchouk polynomials are found. Next, a lower bound is given for the next integral zero for the degree four polynomial. Finally, three new infinite families in q are found for the degree three polynomials. The techniques used are from elementary...

In this contribution we propose a method for generating OWA weighting vectors from the individual assessments on a set of alternatives in such a way that these weights minimize the disagreement among individual assessments and the outcome provided by the OWA operator. For measuring that disagreement we have aggregated distances between individual and collective assessments by using a metric and...

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in C. We study this problem on general sets, but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert-Fekete upper bound for the integer Chebyshev constant, which depends on the dimens...

In this paper, a method based on Chebyshev polynomials is developed for examination of geometrically nonlinear behaviour of thin rectangular composite laminated plates under end-shortening strain. Different boundary conditions and lay-up configurations are investigated and classical laminated plate theory is used for developing the equilibrium equations. The equilibrium equations are solved dir...

Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for colored permutations. First we define a distinguished set of length two and length three patterns, which contains only 312 when just one color is used. Then we give a recursive procedure for computing the generating functio...

We introduce quantized Chebyshev polynomials as deformations of generalized Chebyshev polynomials previously introduced by the author in the context of acyclic coefficient-free cluster algebras. We prove that these quantized polynomials arise in cluster algebras with principal coefficients associated to acyclic quivers of infinite representation types and equioriented Dynkin quivers of type A. ...

in this paper, a new numerical method for solving time-fractional diffusion equations is introduced. for this purpose, finite difference scheme for discretization in time and chebyshev collocation method is applied. also, to simplify application of the method, the matrix form of the suggested method is obtained. illustrative examples show that the proposed method is very efficient and accurate.

In this paper, an Adomian decomposition method using Chebyshev orthogonal polynomials is proposed to solve a well-known class of weakly singular Volterra integral equations. Comparison with the collocation method using polynomial spline approximation with Legendre Radau points reveals that the Adomian decomposition method using Chebyshev orthogonal polynomials is of high accuracy and reduces th...