In this article a modification of the Chebyshev collocation method is applied to the solution of space fractional differential equations.The fractional derivative is considered in the Caputo sense.The finite difference scheme and Chebyshev collocation method are used .The numerical results obtained by this way have been compared with other methods.The results show the reliability and efficiency...

1. R. L. Adler & T. J. Rivlin. "Ergodic and Mixing Properties of Chebyshev Polynomials." Proa. Amer. Math. Soc. 15 (1964) :79'4-7'96. 2. P. Johnson & A. Sklar. "Recurrence and Dispersion under Iteration of Cebysev Polynomials." To appear. 3. C.H. Kimberling. "Four Composition Identities for Chebyshev Polynomials." This issue, pp. 353-369. 4. T. J. Rivlin. The Chebyshev Polynomials. New York: Wi...

occur in the analysis of biological networks. They also include as special cases the known growth laws and probability functions, famous differential equations like those of Bessel, Chebyshev, and Laguerre, and solutions to important physical problems. These systems have no known analytical solution. However, an important subclass comprising many of the special cases mentioned above is solved. ...

We develop complex Jacobi, Gegenbauer and Chebyshev polynomial expansions for the kernels associated with power-law fundamental solutions of the polyharmonic equation on d-dimensional Euclidean space. From these series representations we derive Fourier expansions in certain rotationally-invariant coordinate systems and Gegenbauer polynomial expansions in Vilenkin’s polyspherical coordinates. We...

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

The Chebyshev norm of a degree n trigonometric polynomial is estimated against a discrete maximum norm based on equidistant sampling points where, typically, oversampling rather than critical sampling is used. The bounds are derived from various methods known from classical Approximation Theory. These estimates are of fundamental importance for the design of efficient OFDM in communication syst...

In this paper, we propose a new method to design an observer and control the linear singular systems described by Chebyshev wavelets. The idea of the proposed approach is based on solving the generalized Sylvester equations. An example is also given to illustrate the procedure.

Stabilized or Chebyshev explicit methods have been widely used in the past to solve stiff ordinary differential equations. Making use of special properties of Chebyshev-like polynomials, these methods have favorable stability properties compared to standard explicit methods while remaining explicit. A new class of such methods, called ROCK, introduced in [Numer. Math., 90, 1-18, 2001] has recen...

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.