Mathematical Problems in Engineering

Volume 2015, Article ID 902161, 10 pages

http://dx.doi.org/10.1155/2015/902161

## Numerical Algorithm to Solve a Class of Variable Order Fractional Integral-Differential Equation Based on Chebyshev Polynomials

School of Aeronautic Science and Technology, Beihang University, Beijing 100191, China

Received 24 May 2015; Revised 30 August 2015; Accepted 31 August 2015

Academic Editor: Kishin Sadarangani

Copyright © 2015 Kangwen Sun and Ming Zhu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The purpose of this paper is to study the Chebyshev polynomials for the solution of a class of variable order fractional integral-differential equation. The properties of Chebyshev polynomials together with the four kinds of operational matrixes of Chebyshev polynomials are used to reduce the problem to the solution of a system of algebraic equations. By solving the algebraic equations, the numerical solutions are acquired. Further some numerical examples are shown to illustrate the accuracy and reliability of the proposed approach and the results have been compared with the exact solution.

#### 1. Introduction

Fractional calculus has attracted increasing attention for decades since it plays a vital role in different disciplines of science and engineering [1–3]. Compared with integer order differential equation, fractional differential equation has the advantage that it can better describe some natural physics processes and dynamic system processes, because the fractional order differential operators are nonlocal operators. Many physics, chemistry, and engineering systems can be elegantly modeled with the help of the FDEs, such as dielectric polarization, viscoelastic systems, control theory, chaotic behavior, and electrolyte-electrolyte polarization [4–6]. Since its tremendous applications in several disciplines, considerable attention has been given to the exact and the numerical solutions of fractional differential equations and fractional integral equations. Even numerical approximation of fractional differentiation of rough functions is not easy as it is an ill-posed problem.

Other than modeling aspects of these differential equations, the solution techniques and their reliability are rather more significant. In order to obtain the goal of highly accurate and reliable solutions, several methods have been proposed to solve the fractional order differential and fractional order integral equations. The most commonly used methods are Variational Iteration Method [7], Adomian Decomposition Method [8, 9], Generalized Differential Transform Method [10, 11], and Wavelet Method [12, 13].

Recently, more and more physicists and mathematicians are finding that numerous important dynamical problems exhibit fractional order behavior which can vary with space and time. This fact indicates that variable order calculus provides an effective mathematical framework for the description of complex dynamical problems. The concept of a variable order operator is a much more recent development, which is a new orientation in engineering. Many researchers have proposed different definitions of variable order differential operators, each of these with a specific meaning to get desired goals. The variable order operator definitions recently proposed in the engineering include the Riemann-Liouville definition, Marchaud definition, Grünwald definition, Caputo definition, and Coimbra definition [14, 15].

In this paper, the main objective is to introduce the Chebyshev polynomials method to solve the variable order fractional integral-differential equation. The method is based on reducing the equation to a system of algebraic equations by expanding the solution as Chebyshev polynomials with unknown coefficients. The main characteristic of an operational method is to convert the integral-differential equation into an algebraic one. It not only simplifies the problem but also speeds up the computation.

Our study focuses on a class of variable order fractional integral-differential equation as follows: subject to the initial conditionswhere is fractional derivative of Caputo sense; when , the initial problem is changed to nonlinear equation. , , , and are assumed to be casual functions of time and space on the section , where , , and are known and is the unknown, .

#### 2. Chebyshev Polynomials and Their Properties

The well-known Chebyshev polynomials are defined on the interval and can be determined with the recurrence formula [16]The analytic form of the Chebyshev polynomials of degree is given bywhere denotes the integer part of and denotes positive integer. The orthogonality condition isIn order to use these polynomials on the interval , we define the shifted Chebyshev polynomials by introducing the change of variable . Therefore, the shifted Chebyshev polynomials are defined as . The analytic form of the shifted Chebyshev polynomials of degree is given byLet The Chebyshev polynomials given by (6) can be expressed in the matrix formwhereObviouslyA function can be expressed in terms of the Chebyshev basis. In practice, only the first term of Chebyshev polynomials is considered. Hencewhere , are called Chebyshev coefficients and . The dimension of is ; it is called the inner product matrix which is given bywhereFor the function , we can also obtain its approximation by using Chebyshev polynomialswhere

Theorem 1 (see [16]). *The error in approximating by the sum of its first terms is bounded by the sum of the absolute values of all the neglected coefficients. Ifthenfor all , all , and all .*

Theorem 2 (see [17]). *The Caputo fractional derivative of order for the shifted Chebyshev polynomials can be expressed in terms of the shifted Chebyshev polynomials themselves in the following form:where*

Theorem 3. *The error in approximating by is bounded by .*

*Proof. *A combination of (17) and (25) leads to but , so we can getsubtracting the truncated series from the infinite series, bounding each term in the difference, summing the bounds, and hence completing the proof of the theorem.

#### 3. Operational Matrix of the Chebyshev Polynomials

##### 3.1. Fractional Calculus

Before we introduce the Chebyshev polynomials operational matrix of the fractional integration, we first review some basic definitions of fractional calculus, which have been given in [18].

*Definition 4. *The Riemann-Liouville fractional integral operator of order :

*Definition 5. *Riemann-Liouville fractional derivate with order :

*Definition 6. *Caputo’s fractional derivate with order , : If we assume the starting time in a perfect situation, we can obtain the definition as follows:Generally, we adopt (25) as the definition of fractional derivate in Caputo sense. With the definition above, we can obtain the following formula :

##### 3.2. The Operational Matrix of the Section as in terms of Chebyshev Polynomials

The differentiation of vector in (7) can be given bywhere is the operational matrix of derivatives for Chebyshev polynomials. From (8) we haveDefine the matrix and vector asEquation (28) may then be restated asNow we expand vector in terms of . From (10), we get where is th row of , .

Then we haveTherefore we obtain the operational matrix of the section as as follows:

##### 3.3. The Operational Matrix of the Section as in terms of Chebyshev Polynomials

If we approximate the functions , with Chebyshev polynomials, they can be written as and , where is unknown and is known. Then we haveNow we define is called the operational matrix of the section as with Chebyshev polynomials.

So we have

##### 3.4. The Operational Matrix of the Section as in terms of Chebyshev Polynomials

The integration of the vector in (7) can be expressed aswhere is the operational matrix of integration for Chebyshev polynomials. So we havewhere is an matrix:Now we approximate the elements of vector in terms of . By (10), then we havewhere is the th row of for . We just need to approximate . By using , we have We defineThen we can get . Therefore we have the operational matrix of integration as follows:So we have

##### 3.5. The Operational Matrix of the Section as in terms of Chebyshev Polynomials

Firstly, we approximate the function with Chebyshev polynomials; it can be written as , and is known. So we haveWe define is called the operational matrix of the section as in terms of Chebyshev polynomials.

Therefore the initial equation is transformed into the products of several dependent matrixes as follows:Dispersing (48) with , by using a symbolic software such as “Mathematica,” we can get . So the numerical solution of the original problem is obtained ultimately.

#### 4. Numerical Examples

To demonstrate the efficiency and the practicability of the proposed method based on Chebyshev polynomials method, we present some examples and find their solution via the method described in the previous section.

*Example 1. *
ConsiderwhereThe exact solution of the above equation is .

Taking , dispersing , , we can get the matrix as follows:The absolute error between the exact solution and the numerical solution is displayed in Figure 1.

Taking , dispersing , , we can get the matrix as follows:The absolute error between the exact solution and the numerical solution is displayed in Figure 2.