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

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 spectral methods seek the numerical solutions by a set of known polynomials. The main advantage of using spectral methods for solving atmospheric problems is the high efficiency and conservations of important quadratic quantities such as kinetic energy and enstrophy. Namely, we can get very high accuracy through the exponential convergence. The conservation of the quadratic quantities are i...

We review the main results of the seminal paper of Widom [2] on asymptotics of or-thogonal and Chebyshev polynomials associated with a set E (i.e., the monic polynomialsof degree at most n that minimize the sup-norm‖Tn‖E), where E is a system of Jordanregions and arcs. Thiran and Detaille [1], considered the Chebyshev polynomials Tn on acircular arc Aα and managed to fin...

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.

Decomposition-based methods are often cited as the solution to multi-objective nonconvex optimization problems with an increased number of objectives. These methods employ a scalarizing function to reduce the multi-objective problem into a set of single objective problems, which upon solution yield a good approximation of the set of optimal solutions. This set is commonly referred to as Pareto ...

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.