This paper is concerned with deriving some new formulae expressing explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is one or two of any degree and of any order in terms of their corresponding Jacobi polynomials. The derivatives formulae for Chebyshev polynomials of third and fourth kinds of any degree and of any order in terms of their corresponding Cheby...

approximating the solution of differential equations of fractional order is necessary because fractional differential equations have extensively been used in physics, chemistry as well as engineering fields. in this paper with central difference approximation and newton cots integration formula, we have found approximate solution for a class of boundary value problems of fractional order. three...

and Applied Analysis 3 where we refer to 1.4 for the am’s and we follow the convention ∏m−1 j m · · · 1. We can easily check that cm’s satisfy the following relation: m 2 m 1 cm 2 − ( m2 − n2 ) cm am 2.2 for any m ∈ {0, 1, 2, . . .}. Theorem 2.1. Assume that n is a positive integer and the radius of convergence of the power series ∑∞ m 0 amx m is ρ > 0. Let ρ0 min{1, ρ}. Then, every solution y ...

Interpolation polynomial pn at the Chebyshev nodes cosπj/n (0 ≤ j ≤ n) for smooth functions is known to converge fast as n → ∞. The sequence {pn} is constructed recursively and efficiently in O(n log2 n) flops for each pn by using the FFT, where n is increased geometrically, n = 2i (i = 2, 3, . . . ), until an estimated error is within a given tolerance of ε. This sequence {2j}, however, grows ...

Abstract In this research, a compact combination of Chebyshev polynomials is created and used as spatial basis for the time fractional fourth-order Euler–Bernoulli pinned–pinned beam. The method based on applying Petrov–Galerkin procedure to discretize differential problem into system linear algebraic equations with unknown expansion coefficients. Using efficient Gaussian elimination procedure,...