Efficient Chebyshev spectral methods for solving multi-term fractional orders differential equations

In this paper, we state and prove a new formula expressing explicitly the derivatives of shifted Chebyshev polynomials of any degree and for any fractional-order in terms of shifted Chebyshev polynomials themselves. We develop also a direct solution technique for solving the linear multi-order fractional differential equations (FDEs) with constant coefficients using a spectral tau method. The spatial approximation with its fractional-order derivatives (described in the Caputo sense) are based on shifted Chebyshev polynomials T_L,n(x) with x ∈ (0, L), L > 0 and n is the polynomial degree. We presented a shifted Chebyshev collocation method with shifted Chebyshev–Gauss points used as collocation nodes for solving nonlinear multi-order fractional initial value problems. Several numerical examples are considered aiming to demonstrate the validity and applicability of the proposed techniques and to compare with the existing results.     

The operational matrix of fractional integration for shifted Chebyshev polynomials

A new shifted Chebyshev operational matrix (SCOM) of fractional integration of arbitrary order is introduced and applied together with spectral tau method for solving linear fractional differential equations (FDEs). The fractional integration is described in the Riemann–Liouville sense. The numerical approach is based on the shifted Chebyshev tau method. The main characteristic behind the approach using this technique is that only a small number of shifted Chebyshev polynomials is needed to obtain a satisfactory result. Illustrative examples reveal that the present method is very effective and convenient for linear multi-term FDEs.     

A quadrature tau method for fractional differential equations with variable coefficients

In this article, we develop a direct solution technique for solving multi-order fractional differential equations (FDEs) with variable coefficients using a quadrature shifted Legendre tau (Q-SLT) method. The spatial approximation is based on shifted Legendre polynomials. A new formula expressing explicitly any fractional-order derivatives of shifted Legendre polynomials of any degree in terms of shifted Legendre polynomials themselves is proved. Extension of the tau method for FDEs with variable coefficients is treated using the shifted Legendre–Gauss–Lobatto quadrature. Numerical results are given to confirm the reliability of the proposed method for some FDEs with variable coefficients.     

Wavelets method for solving systems of nonlinear singular fractional Volterra integro-differential equations

This paper presents a computational method for solving a class of system of nonlinear singular fractional Volterra integro-differential equations. First, existences of a unique solution for under studying problem is proved. Then, shifted Chebyshev polynomials and their properties are employed to derive a general procedure for forming the operational matrix of fractional derivative for Chebyshev wavelets. The application of this operational matrix for solving mentioned problem is explained. In the next step, the error analysis of the proposed method is investigated. Finally, some examples are included for demonstrating the efficiency of the proposed method.     

Application of orthogonal expansions for approximate integration of ordinary differential equations

An approximate method to solve the Cauchy problem for normal and canonical systems of second-order ordinary differential equations is proposed. The method is based on the representation of a solution and its derivative at each integration step in the form of partial sums of series in shifted Chebyshev polynomials of the first kind. A Markov quadrature formula is used to derive the equations for the approximate values of Chebyshev coefficients in the right-hand sides of systems. Some sufficient convergence conditions are obtained for the iterative method solving these equations. Several error estimates for the approximate Chebyshev coefficients and for the solution are given with respect to the integration step size.     

General fractional variational problem depending on indefinite integrals

In this report, we consider two kind of general fractional variational problem depending on indefinite integrals include unconstrained problem and isoperimetric problem. These problems can have multiple dependent variables, multiorder fractional derivatives, multiorder integral derivatives and boundary conditions. For both problems, we obtain the Euler-Lagrange type necessary conditions which must be satisfied for the given functional to be extremum. Also, we apply the Rayleigh-Ritz method for solving the unconstrained general fractional variational problem depending on indefinite integrals. By this method, the given problem is reduced to the problem for solving a system of algebraic equations using shifted Legendre polynomials basis functions. An approximate solution for this problem is obtained by solving the system. We discuss the analytic convergence of this method and finally by some examples will be showing the accurately and applicability for this technique.     

Integrals of Bernstein polynomials: An application for the solution of high even-order differential equations

A new explicit formula for the integrals of Bernstein polynomials of any degree for any order in terms of Bernstein polynomials themselves is derived. A fast and accurate algorithm is developed for the solution of high even-order boundary value problems (BVPs) with two point boundary conditions but by considering their integrated forms. The Bernstein–Petrov–Galerkin method (BPG) is applied to construct the numerical solution for such problems. The method is then tested on examples and compared with other methods. It is shown that the BPG yields better results.     

Numerical treatment for solving fractional Riccati differential equation

This paper presents an accurate numerical method for solving fractional Riccati differential equation (FRDE). The proposed method so called fractional Chebyshev finite difference method (FCheb-FDM). In this technique, we approximate FRDE with a finite dimensional problem. The method is based on the combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The Caputo fractional derivative is replaced by a difference quotient and the integral by a finite sum. By this method the given problem is reduced to a problem for solving a system of algebraic equations, and by solving this system, we obtain the solution of FRDE. Special attention is given to study the convergence analysis and estimate an error upper bound of the obtained approximate formula. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique.     

The evaluation of the error term in some Gauss-type formulae for the approximation of Cauchy Principal Value integrals

A method is derived for the numerical evaluation of the error term arising in some Gauss-type formulae modified so as to approximate Cauchy Principal Value integrals. The method uses Chebyshev polynomials of the first kind.     

Numerical Solution of the Two-Sided Space–Time Fractional Telegraph Equation Via Chebyshev Tau Approximation

The operational matrices of left Caputo fractional derivative, right Caputo fractional derivative, and Riemann–Liouville fractional integral, for shifted Chebyshev polynomials, are presented and derived. We propose an accurate and efficient spectral algorithm for the numerical solution of the two-sided space–time Caputo fractional-order telegraph equation with three types of non-homogeneous boundary conditions, namely, Dirichlet, Robin, and non-local conditions. The proposed algorithm is based on shifted Chebyshev tau technique combined with the derived shifted Chebyshev operational matrices. We focus primarily on implementing the novel algorithm both in temporal and spatial discretizations. This algorithm reduces the problem to a system of algebraic equations greatly simplifying the problem. This system can be solved by any standard iteration method. For confirming the efficiency and accuracy of the proposed scheme, we introduce some numerical examples with their approximate solutions and compare our results with those achieved using other methods.     

A numerical technique for solving fractional variational problems

This paper presents an accurate numerical method for solving a class of fractional variational problems (FVPs). The fractional derivative in these problems is in the Caputo sense. The proposed method is called fractional Chebyshev finite difference method. In this technique, we approximate FVPs and end up with a finite‐dimensional problem. The method is based on the combination of the useful properties of Chebyshev polynomials approximation and finite difference method. The Caputo fractional derivative is replaced by a difference quotient and the integral by a finite sum. The fractional derivative approximation using Clenshaw and Curtis formula introduced here, along with Clenshaw and Curtis procedure for the numerical integration of a non‐singular functions and the Rayleigh–Ritz method for the constrained extremum, is considered. By this method, the given problem is reduced to the problem for solving a system of algebraic equations, and by solving this system, we obtain the solution of FVPs. Special attention is given to study the convergence analysis and evaluate an error upper bound of the obtained approximate formula. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique. A comparison with another method is given. Copyright © 2012 John Wiley & Sons, Ltd.     

On the numerical solutions for the fractional diffusion equation

Fractional differential equations have recently been applied in various area of engineering, science, finance, applied mathematics, bio-engineering and others. However, many researchers remain unaware of this field. In this paper, an efficient numerical method for solving the fractional diffusion equation (FDE) is considered. The fractional derivative is described in the Caputo sense. The method is based upon Chebyshev approximations. The properties of Chebyshev polynomials are utilized to reduce FDE to a system of ordinary differential equations, which solved by the finite difference method. Numerical simulation of FDE is presented and the results are compared with the exact solution and other methods.     

Calculation of expansion coefficients of series in Chebyshev polynomials for a solution to a Cauchy problem

Two approaches are proposed to determine an initial approximation for the coefficients of an expansion of the solution to a Cauchy problem for ordinary differential equations in the form of series in shifted Chebyshev polynomials of the first kind. This approximation is used in an analytical method to solve ordinary differential equations using orthogonal expansions.     

Chebyshev operational matrix method for solving multi-order fractional ordinary differential equations

The aim of this article is to present an analytical approximation solution for linear and nonlinear multi-order fractional differential equations (FDEs) by extending the application of the shifted Chebyshev operational matrix. For this purpose, we convert FDE into a counterpart system and then using proposed method to solve the resultant system. Our results in solving four different linear and nonlinear FDE, confirm the accuracy of proposed method.     

Analytical method based on Walsh function combined with orthogonal polynomial for fractional transport equation

In this paper a novel method based on Walsh function combined with a Chebyshev polynomials of the first kind was applied for the resolution of fractional transport equation in three-dimensions. A specific application of the method is discussed.     

Numerical solution of the delay differential equations of pantograph type via Chebyshev polynomials

In this article we propose a numerical scheme to solve the pantograph equation. The method consists of expanding the required approximate solution as the elements of the shifted Chebyshev polynomials. The Chebyshev pantograph operational matrix is introduced. The operational matrices of pantograph, derivative and product are utilized to reduce the problem to a set of algebraic equations. An error analysis is presented which allows the number of polynomials employed in the approximation to be selected in advance for a desired tolerance. Some examples are given to demonstrate the validity and applicability of the new method and a comparison is made with the existing results.     

Jacobi-Picard iteration method for the numerical solution of nonlinear initial value problems

In this paper, an effective numerical iterative method for solving nonlinear initial value problems (IVPs) is presented. The proposed iterative scheme, called the Jacobi-Picard iteration (JPI) method, is based on the Picard iteration technique, orthogonal shifted Jacobi polynomials, and shifted Jacobi-Gauss quadrature formula. In comparison with traditional methods, the JPI method uses an iterative formula for updating next step approximations and calculating integrals of the shifted Jacobi polynomials are performed via an exact relation. Also, a vector-matrix form of the JPI method is provided in details which reduce the CPU time. The performance of the presented method has been investigated by solving several nonlinear IVPs. Numerical results show the efficiency and the accuracy of the proposed iterative method.     

Gauss quadrature routines for two classes of logarithmic weight functions

By means of the Matlab symbolic/variable-precision facilities, routines are developed that generate an arbitrary number of recurrence coefficients to any given precision for polynomials orthogonal with respect to weight functions of Laguerre and Jacobi type containing logarithmic factors. The vehicle used is a symbolic modified Chebyshev algorithm based on ordinary as well as modified moments, executed with sufficiently high precision. The results are applied to Gaussian quadrature of integrals involving weight functions of the type mentioned.     

On the calculation of certain singular integrals

A method for the approximate calculation of Cauchy-type integrals with logarithmic singularities is proposed. It is based on the expansion of a functionf(t) in a series in the Chebyshev polynomials.Translated from Ukrainskii Matematicheskii Zhumal, Vol. 45, No. 8, pp. 1174–1176, August, 1993.     

Algorithms for the integration and derivation of Chebyshev series

General formulas for the mth integral and derivative of a Chebyshev polynomial of the first or second kind are presented. The result is expressed as a finite series of the same kind of Chebyshev polynomials. These formulas permit to accelerate the determination of such integrals or derivatives. Besides, it is presented formulas for the mth integral and derivative of finite Chebyshev series and a numerical algorithm for the direct evaluation of the mth derivative of such a series.