Volume 2014, Issue 1 207916
Research Article
Open Access

Tau-Path Following Method for Solving the Riccati Equation with Fractional Order

Muhammed I. Syam

Corresponding Author

Muhammed I. Syam

Department of Mathematical Sciences, United Arab Emirates University, Al Ain 15551, United Arab Emirates uaeu.ac.ae

Search for more papers by this author
Hani I. Siyyam

Hani I. Siyyam

Department of Mathematics, Taibah University, Al Madinah, Saudi Arabia taibahu.edu.sa

Search for more papers by this author
Ibrahim Al-Subaihi

Ibrahim Al-Subaihi

Department of Mathematics, Taibah University, Al Madinah, Saudi Arabia taibahu.edu.sa

Search for more papers by this author
First published: 05 March 2014
Citations: 13
Academic Editor: Marta B. Rosales

Abstract

A formulation for the fractional Legendre functions is constructed to find the solution of the fractional Riccati equation. The fractional derivative is described in the Caputo sense. The method is based on the Tau Legendre and path following methods. Theoretical and numerical results are presented. Analysis for the presented method is given.

1. Introduction

Recently, many papers on fractional boundary value problems have been studied extensively. Several forms of them have been proposed in standard models, and there has been significant interest in developing numerical schemes for their solutions. Several numerical techniques are used to solve such problems such as Laplace and Fourier transforms [1, 2], Adomian decomposition and variational iteration methods [3, 4], eigenvector expansion [5], differential transform and finite differences methods [6, 7], power series method [8], collocation method [9], and wavelet method [10, 11]. Many applications of fractional calculus on various branches of science such as engineering, physics, and economics can be found in [12, 13]. Considerable attention has been given to the theory of fractional ordinary differential equations and integral equations [14, 15]. Additionally, the existence of solutions of ordinary and fractional boundary value problems using monotone iterative sequences has been investigated by several authors [1620].

We consider the Riccati equation with fractional orders of the form
()
()
where a, b, c, and g are continuous functions on [0,1] and  yini is a constant.

Riccati equation with fractional order has been discussed by many researchers using different techniques such as collocation method based on Muntz polynomials [21], homotopy perturbation method [22], and series solution method [23].

In this paper we study the Tau-path following method for solving the Riccati equation with fractional order. We organize this paper as follows. In Section 2, we present basic definitions and results of fractional derivatives. We extend basic results to path following method for the fractional case. In Section 3, we introduce the fractional-order Legendre Tau method with path following method for solving the Riccati equation with fractional order. In Section 4, we present some numerical results to illustrate the efficiency of the presented method. Finally, we conclude with some comments in the last section.

2. Preliminaries

In this section, we review the definition and some preliminary results of the Caputo fractional derivatives, as well as, the definition of the fractional-order Legendre functions and their properties.

Definition 1. The Riemann-Liouville fractional integral operator Iα of order α > 0 on the usual Lebesgue space L1[0,1] is given by

()
where is the Euler Gamma function, see [12, 24].

For any fL1[0,1],  α,  β⩾0, and γ > −1, the following properties hold:
  • (1)

    Iα exists for any x ∈ [0,1],

  • (2)

    IαIβ = Iα+β,

  • (3)

    IαIβ = IβIα,

  • (4)

    Iαxγ = (Γ(γ + 1)/Γ(α + γ + 1))xα+γ.

Definition 2. The Caputo fractional derivative of order α is defined by

()
provided that the integral exists, where n = [α] + 1 and [α] is the integer part of the positive real number α, x > 0.

The Caputo fractional derivative satisfies the following properties for fL1[0,1] and α, β⩾0:
  • (1)

    DαIαf(x) = f(x),

  • (2)

    ,

  • (3)

    DαDβf(x) = DβDαf(x) = Dα+βf(x), x > 0,

  • (4)

    Dαc = 0, where c is constant,

  • (5)

    ,

  • (6)

    , where c1, c2, …, cm are constants.

The basic concept of this paper is the Legendre polynomials. For this reason, we study some of their properties.

Definition 3. The Legendre polynomials {k(x) : k = 0,1, 2, …} are the eigenfunctions of the Sturm-Liouville problem

()

Among the properties of the Legendre polynomials we list the following properties:
  • (1)

    , where ,

  • (2)

    i+1(x) = ((2i + 1)/(i + 1))xi(x)−(i/(i + 1))i−1(x), for i⩾1,

  • (3)

    i(±1) = (±1) i.

In order to use these polynomials on the interval [0,1], we define the shifted Legendre polynomials by Si(z) = i(2z − 1). Using the change of variable x = 2z − 1, Si(z) has the following properties:
  • (1)

    ,

  • (2)

    Si+1(z) = ((2i + 1)/(i + 1))(2z − 1)Si(z)−(i/(i + 1))Si−1(z), for i⩾1,

  • (3)

    Si(0) = (−1) i and Si(1) = 1.

The analytic closed form of the shifted Legendre polynomials of degree i is given by
()
One of the common and efficient methods for solving fractional differential equations of order α > 0is using the series expansion of the form . For this reason, we define the fractional-order Legendre function by . Using the properties of the shifted Legendre polynomials and the change of variable z = tα, it is easy to show that
  • (1)

    ,

  • (2)

    , for i⩾1,

  • (3)

    and ,

  • (4)

    and .

In addition, are orthogonal functions with respect to the weight function w(t) = tα−1 on (0,1) with
()
The closed form of is given by
()
Using properties (4) and (5) of the Caputo fractional derivative, one can see that
()

In the next theorem, we state one of the main properties of the fractional Legendre functions which will be used later in this paper.

Theorem 4. For any nonnegative integers p and q,

()
where
()

Proof. For any nonnegative integers p and q,

()
where
()

For the proof of this case, see [25]. Using the change of variables x = 2z − 1 and z = tα, we obtain the result of the theorem.

Another important result which will facilitate applying the Tau method for fractional case is given in Theorem 5.

Theorem 5. Let uC[0,1] and u(t) be a piecewise continuous function on [0,1]. Then, u(t) can be written in the infinite expansion as , where

()
and w(t) = tα.

Proof. If uC1[−1,1] and u′′(x) is a piecewise continuous function on [−1,1],  converges uniformly to u(x) on [−1,1], see [2628]. Let h : [0,1] → [−1,1] by

()
Since h(t) is a bijective continuous function, converges uniformly to u(t) on [0,1]. The value of uk follows from the orthogonality relation of with respect to the weight function w(t) = tα−1 on [0,1]

Theorem 6 gives the relation between the coefficient of the series solution of Dαu(t) and the coefficients of the series expansion of u(t).

Theorem 6. Let uC1[0,1] and u′′(t) be a piecewise continuous function on [0,1]. Then, converges uniformly on [0,1] to Dαu(t), where

()

Proof. Let for n = 0,1, 2, …. From Theorem 5, Sn(t) converges uniformly to u(t) on [0,1].    Since uC1[0,1] and u′′(t) is a piecewise continuous function on [0,1],

()
and (d/dt)Sn(t) converges uniformly to (d/dt)u(t) on [0,1]. Thus, converges uniformly to on [0,1] which gives the result of the theorem. The value of ajk follows from the orthogonality relation of with respect to the weight function w(t) = tα−1 on [0,1].

3. Fractional-Order Legendre Tau-Path Following Method

In this section, we present a numerical method for solving problem (1)-(2). We use the fractional-order Legendre Tau method to discretize problem (1)-(2). The result is a nonlinear system. The initial guess that is used in the standard methods for solving the produced nonlinear system is one of the challenges. To overcome this problem, we use the path following method. Approximate the solution y(x), a(x), b(x), c(x), and g(x) in terms of the fractional-order Legendre functions as follows:
()
Thus, Dαy(x) can be approximated by
()
where is given by Theorem 6. For YN, the residual is given by
()
which can be written as
()
or
()
where aj = 0, bj = 0, yj = 0, cj = 0 for jN + 2, and for jN + 1. Using Theorem 4, we can rewrite the residual as
()
Since we are interested in the first n terms only, we ignore higher order terms and we rewrite the residual as
()
Orthogonalize the residual with respect to the fractional-order Legendre function as follows
()
where w(x) = xα−1. Therefore, (25) leads to the elementwise equation
()
Therefore, we can write (26) as a system of N nonlinear equations in (N + 1) unknowns as
()
where , and T means the transpose of the matrix.
From the initial condition (2), one can see that
()
or
()
where . From systems (27) and (29), we obtain a system of (N + 1) nonlinear equations in (N + 1) unknowns
()
where Ψ : N+1N+1 by and N+1.
The standard methods for solving system (30), such as secant method and Newton method, need a good initial guess which is not available. To overcome this problem, we look for another method which does not depend on the initial guess. The promise technique is the path following method which is described as follows. From (23), we can see that the function Ω    is the sum of three terms. Two of them are linear systems which are and . The third term is nonlinear system which is
()
Thus, we can rewrite Ω as
()
where A1 and A2 are two N × (N + 1) matrices and Ω1 : N+1N is a nonlinear function of Y.    Hence, system (30) can be written as
()
where is (N + 1)×(N + 1) matrix and Ψ1 : N+1N+1 is a nonlinear function of Y given by . Define the function H : N+1 × [0,1] → N+1 by
()
Thus, H satisfies the following properties
  • (1)

    HC(N+1 × [0,1]),

  • (2)

    H(0, 0) = 0,

  • (3)

    (H/Y)(0, 0) = A.

It is worth to mention that A is a nonsingular matrix since AY = R is the system produced by the following problem:
()
which has a unique solution. Hence, it follows from the implicit function theorem that there is a smooth curve γ : IN+1 for some open interval I containing zero such that γ(0) = 0, γ(0) ≠ 0, rank⁡(H(γ(s))) = N + 1, and
()
for all sI. Consider the solution γ(s) = (Y(s), λ(s)) (parametrized for convenience with respect to arc length) such that γ(0) = (0, 0). The solution curve H−1(Y(0), λ(0)) should be either diffeomorphic to the circle or to the real line. Since the solution point (0, 0) is unique for λ = 0, it follows that γ cannot be closed, and hence, it is diffeomorphic to the real line. Since γ is a smooth curve, Y(s) is bounded for λ(s) ∈ [0,1].    Moreover, the curve γ reaches the level λ = 1    after a finite arc length s1. This means, , and hence, is the zero of     Ψ(Y) − R. Thus, we can take I = [0,1]. For more details about the proof, [2931]. To apply path following method numerically, we differentiate (36) to get
()
which implies that γ(0) is orthogonal to all rows of H(γ(0)).    Thus, for all s ∈ [0,1],
  • (1)

    ,

  • (2)

    γ(s)∥ = 1, where ∥·∥ is the Euclidean norm,

  • (3)

    H(γ(s))γ(s) = 0.

We use the predictor-corrector method to numerically trace the curve γ. The predictor step is the Euler-predictor which is given by
()
where Z     is a point along the curve γ, and h > 0 is a fixed step size. The corrector step is the Gauss-Newton corrector which is given by
()
where H(X) + = (H(X)) T(H(X)H(X) T) −1. For more details, see [31]. Thus, we will start from Z0 = (0, 0) and then generate the sequence Z1, Z2, Z3, … We stop our procedure at Zk when the last component of Zk ≤ 1 and the last component of Zk+1 > 1.    We can write Zk as Zk = (Yk, λk). Thus, Yk will be the approximate solution to the system (33).

4. Numerical Results

In this section, we implement the Tau-Path following method to the nonlinear fractional Riccati differential equations. Two examples of nonlinear fractional Riccati differential equations are solved to show the efficiency of the presented method.

Example 7. Consider the following initial value problem [32]:

()

The matrices in (33) are

()

It is easy to see that |det⁡(A)| = 1 which means A is nonsingular. Define the error by

()

Then, the absolute maximum of the error for different values of α are given in Table 1 for N = 16.

The exact solution when α = 1 is . The graphs of the approximate solution when    α = 0.9999 and the graph of the exact solution when α = 1 are given in Figure 1.

α Error
0.5 1*10−9
0.9 2*10−10
0.99 1.2*10−10
0.9999 1.7*10−12
Details are in the caption following the image
The graphs of the approximate solution when    α = 0.9999 and the graph of the exact solution when α = 1.

Example 8. Consider the following initial value problem [32]:

()

The matrices in (33) are

()

It is easy to see that |det⁡(A)| = 1 which means A is nonsingular. Define the error by

()

Then, the absolute maximum of the error for different values of α is given in Table 2 for N = 16.

The exact solution when α = 1 is y(x) = (x(J−3/4(x2/2)Γ(1/4) + J3/4(x2/2)Γ(3/4)))/(J1/4(x2/2)Γ(1/4) − 2J−1/4(x2/2)Γ(3/4)) where Jν(x) is the Bessel function of first kind. The graphs of the approximate solution when    α = 0.9999 and the exact solution when α = 1 are given in Figure 2.

α Error
0.5 2.7*10−10
0.9 8.6*10−11
0.99 5.4*10−11
0.9999 2.1*10−13
Details are in the caption following the image
The graphs of the approximate solution when    α = 0.9999 and the exact solution when α = 1.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The authors would like to express their appreciation for the valuable comments of the reviewers. The authors also would like to express their sincere appreciation to United Arab Emirates University for the financial support of Grant no. COS/IRG-15/14.

      The full text of this article hosted at iucr.org is unavailable due to technical difficulties.