We analyze the asymptotic rates of convergence of Chebyshev, Legendre and Jacobi polynomials. One complication is that there are many reasonable measures of optimality as enumerated here. Another is that there are at least three exceptions to the general principle that Chebyshev polynomials give the fastest rate of convergence from the larger family of Jacobi polynomials. When f (x) is singular...

The mathematical theory of closed form functions for calculating LSFs on the basis of generating functions is presented. Exploiting recurrence relationships in the series expansion of Chebyshev polynomials of the first kind makes it possible to bootstrap iterative LSF-search from a set of characteristic polynomial zeros. The theoretical analysis is based on decomposition of sequences into symme...

In this work, the definition of first and second types multiplicative Chebyshev differential equations is given solutions these are investigated with help power series. Also, properties type polynomials proved. Finally, studies supported numerical examples.

The Chebyshev polynomials have many beautiful properties and countless applications, arising in a variety of continuous settings. They are a sequence of orthogonal polynomials appearing in approximation theory, numerical integration, and differential equations. In this paper we approach them instead as discrete objects, counting the sum of weighted tilings. Using this combinatorial approach, on...

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties. r 2003 Elsevier Science (USA). All rights reserved.

When a function is singular at the ends of its expansion interval, its Chebyshev coefficients a, converge very poorly. We analyze three numerical strategies for coping with such singularities of the form (1 + x)~ log(1 f x), and in the process make some modest additions to the theory of Chebyshev expansions. The first two numerical methods are the convergence-improving changes of coordinate x =...

in this paper, we introduce a family of fractional-order chebyshev functions based on the classical chebyshev polynomials. we calculate and derive the operational matrix of derivative of fractional order $gamma$ in the caputo sense using the fractional-order chebyshev functions. this matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...

in this paper, the chebyshev spectral collocation method(cscm) for one-dimensional linear hyperbolic telegraph equation is presented. chebyshev spectral collocation method have become very useful in providing highly accurate solutions to partial differential equations. a straightforward implementation of these methods involves the use of spectral differentiation matrices. firstly, we transform ...