In this paper, by the Chebyshev-type inequalities we define three mappings, investigate their main properties, give some refinements for Chebyshev-type inequalities, obtain some applications.

We show that every two-bridge knot K of crossing number N admits a polynomial parametrization x = T3(t), y = Tb(t), z = C(t) where Tk(t) are the Chebyshev polynomials and b + degC = 3N . If C(t) = Tc(t) is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for a ≤ 3. Most results are derived from continued fractions and their matrix represe...

A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(logN)2/ log logN) operations is derived. The basis of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the di...

in this paper we introduce a type of fractional-order polynomials basedon the classical chebyshev polynomials of the second kind (fcss). also we construct the operationalmatrix of fractional derivative of order $ gamma $ in the caputo for fcss and show that this matrix with the tau method are utilized to reduce the solution of some fractional-order differential equations.

This chapter provides a brief literature review together with detailed descriptions of the authors’ work on the stability and control of systems represented by linear time-periodic delay-differential equations using the Chebyshev and temporal finite element analysis (TFEA) techniques. Here, the theory and examples assume that there is a single fixed discrete delay which is equal to the principa...

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

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 paper, we study the asymptotics of the discrete Chebyshev polynomials tn(z,N) as the degree grows to infinity. Global asymptotic formulas are obtained as n → ∞, when the ratio of the parameters n/N = c is a constant in the interval (0, 1). Our method is based on a modified version of the Riemann-Hilbert approach first introduced by Deift and Zhou.

ll rights reserved. Recently the Chebyshev kernel has been proposed for SVM and it has been proven that it is a valid kernel for scalar valued inputs in [11]. However in pattern recognition, many applications require multidimensional vector inputs. Therefore there is a need to extend the previous work onto vector inputs. In [11], although it is not stated explicitly, the authors recommend evalu...

‎It is commonly accepted that fractional differential equations play‎ ‎an important role in the explanation of many physical phenomena‎. ‎For‎ ‎this reason we need a reliable and efficient technique for the‎ ‎solution of fractional differential equations‎. ‎This paper deals with‎ ‎the numerical solution of a class of fractional differential‎ ‎equation‎. ‎The fractional derivatives are described...