Journal of Mathematics
Volume 2020 (2020), Article ID 8964759, 7 pages
https://doi.org/10.1155/2020/8964759

Research Article

Pade Method for Construction of Numerical Algorithms for Fractional Initial Value Problem

Feng Gao and Chunmei Chi

School of Science, Qingdao University of Technology, Qingdao 266033, China

Correspondence should be addressed to Chunmei Chi; chunmei_chi@163.com

Received 11 April 2020; Accepted 5 June 2020; Published 8 July 2020

Academic Editor: Guotao Wang

Copyright © 2020 Feng Gao and Chunmei Chi. 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.

In this paper, we propose an efficient method for constructing numerical algorithms for solving the fractional initial value problem by using the Pade approximation of fractional derivative operators. We regard the Grunwald–Letnikov fractional derivative as a kind of Taylor series and get the approximation equation of the Taylor series by Pade approximation. Based on the approximation equation, we construct the corresponding numerical algorithms for the fractional initial value problem. Finally, we use some examples to illustrate the applicability and efficiency of the proposed technique.

1. Introduction

In the past decades, fractional differential equations were successfully applied to many problems in engineering, physics, chemistry, biology, economics, control theory, biophysics, and so on [1–5]. It is significant to obtain the exact or numerical solutions of fractional nonlinear equations. Since most fractional differential equations do not have exact analytic solutions, numerical techniques and seminumerical methods are used extensively, such as the homotopy analysis and homotopy perturbation method [6–8], variational iteration method [9–11], orthogonal polynomial method [12, 13], fractional Adams method [14], and some other methods [15].

Among all the numerical methods, the direct numerical method [16–18] is the basic one. Due to the special property of the fractional derivative, most of these methods have their inbuilt deficiencies mostly due to the calculation of Adomian polynomials, the Lagrange multiplier, divergent results, and some other huge computational works.

In this paper, we propose an efficient method for constructing numerical algorithms for solving the fractional initial value problem by using the Pade approximation of fractional derivative operators. The advantage of the proposed technique is that efficient numerical methods can be constructed without calculation of long historical terms of the fractional derivative.

Consider the following homogeneous fractional initial problem:

where is usually the Caputo derivative and . Given the condition , the Caputo derivative is equivalent to the Grunwald–Letnikov derivative and the Riemann–Liouville derivative, e.g.,

For the following linear nonhomogeneous fractional initial problem,

the following transform can be employed to make it be a homogeneous one with regard to :

Based on the algorithm [19], we have the following numerical scheme for problem (1):

where and are calculated according to different algorithms. Algorithm 5 is a technique which is easy to manipulate. However, this method involves huge computational work when because in general, these methods need to compute many terms to get the approximation to the fractional derivative. To some extent, the short memory principle [20] can be used to tackle the problem, but low accuracy will be the cost. So, it is significant to find an efficient approximant to the fractional derivative, which is of low computation cost on the one hand and highly accurate on the other hand. In this paper, we put forward a reliable method for the construction of numerical algorithms for solving the fractional differential initial value problem by using Pade approximation to fractional derivative operators. The rest of the paper is organized as follows. In Section 2, we briefly list some basics of Pade approximation. In Section 3, we get the approximant of the fractional derivative operators. In Section 4, we propose a method for constructing algorithms for solving the fractional initial value problem by using Pade approximation. In Section 5, we use some examples to illustrate the applicability and efficiency of the proposed technique. Section 6 is the conclusion.

2. Some Basics for Pade Approximation

In numerical mathematics, Pade approximation [21] is believed to be the best approximation of a function by rational functions of a given order. Under this technique, the approximant’s power series agrees with the power series of the function it is approximating. The Pade approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. For these reasons, Pade approximants are often used in many fields of computations.

Given a function and two integers and , the Pade approximant of order is the rational function

which agrees with to the highest possible order, which amounts to

Equivalently, if is expanded in a Maclaurin series, its first terms would cancel the first terms of , and as such . The Pade approximant is unique for given and , that is, the coefficients can be uniquely determined. It is for reasons of uniqueness that the zeroth-order term at the denominator of was chosen to be 1; otherwise, the numerator and denominator of would have been unique only up to multiplication by a constant. The Pade approximant defined above is also denoted as .

3. Pade Approximant for the Fractional Derivative Operator

There are many definitions for the fractional derivative. The following equation is called the reverse Grunwald–Letnikov derivative:

where

For any given , if we denote

we have

Therefore, we can denote

So, we have

Let

be the Pade approximant to ; we have

Therefore,

Replacing in (16) with the operator , we have

where 1 can be understood as the identical operator. So, we get the following approximation:

Noticing (13), we get

So, we get

Then, we get the following approximation to fractional derivative operators:

Consider fractional initial value problem (1):

Denote

where is the discretization step size.

From (21), we have

Due to the linearity and commutativity of the operators and , we have

Noticing

we get

Then, we get the following numerical algorithm:

This is a multiple step algorithm for problem (1), where s and s can be determined by the Pade approximation of for any given . From the construction process, we can see the local truncation error of this algorithm is .

4. Some Implicit Multistep Algorithms for the Fractional Initial Value Problem

Let ; the Pade approximant to is

and the Pade approximant to is

Then, from (28), we get the following two multistep algorithms:

in which

in which

In the same way, from the following Pade approximant to ,

we get the following (algorithm (3)):

In the same way, the Pade approximant to is

So, we get the following numerical algorithm:

We can also get the following algorithm by using the [3, 3] Pade approximant to :

and many other more complicated numerical schemes can be constructed by using the Pade approximant for any given .

5. Numerical Tests

5.1. Numerical Test 1

The exact solution to this problem is . We use algorithms (1) and (2) to solve this problem. Because both algorithms (1) and (2) are implicit, we use the iterative method

to get the value of , where

for algorithm 1 and

for algorithm 2, respectively. The computational errors are listed in Table 1 (h = (pi/2)/10). We also compare algorithms (1) and (2) with the exact solution in Figure 1.

Table 1: Computational errors for algorithms (1) and (2).

x
1 h
2 h
3 h
4 h
5 h
6 h
7 h
8 h
9 h
10 h

Algorithm (1)
0.000
0.000
0.0155
0.0318
0.0455
0.0575
0.0716
0.0992
0.0783
0.0069

Algorithm (2)
0.000
0.000
0.000
0.0011
0.0028
0.0043
0.0049
0.0042
0.0211
0.0263

Figure 1: Comparison between algorithms (1) and (2) with the exact solution.

We also make the comparison with the corresponding algorithm. The results are listed in Table 2. The comparison shows that algorithms (1) and (2) are more efficient than the corresponding Grunwald–Letnikov-based algorithm.

Table 2: Computational error comparison with the algorithm.

x
1 h
2 h
3 h
4 h
5 h
6 h
7 h
8 h
9 h
10 h

Algorithm (1)
0.000
0.000
0.0155
0.0318
0.0455
0.0575
0.0716
0.0992
0.0783
0.0069

Algorithm (2)
0.000
0.000
0.000
0.0011
0.0028
0.0043
0.0049
0.0042
0.0211
0.0263

-algm
0.1232
0.1782
0.1642
0.2589
0.2529
0.2762
0.3856
0.3842
0.5485
0.5478

5.2. Numerical Test 2

The exact solution to this problem is . We use the following algorithm (4)

and algorithm (5)

to get the numerical solution. Because both algorithms (4) and (5) are implicit schemes, we use the iterative method to get the value of , where

in algorithm (4) and

in algorithm (5). The errors of the numerical results are listed in Table 3 (h = (pi/2)/10).

Table 3: Computational errors for algorithms (3) and (4).

x
1 h
2 h
3 h
4 h
5 h
6 h
7 h
8 h
9 h
10 h

Algorithm (3)
0.000
0.000
0.0111
0.0123
0.0245
0.0267
0.0343
0.0355
0.0455
0.0058

Algorithm (4)
0.000
0.000
0.0000
0.0009
0.0019
0.0038
0.0037
0.0042
0.0111
0.0165

The comparison with the corresponding algorithm is listed in Table 4. The comparison shows that algorithms (4) and (5) are more efficient than the corresponding algorithm.

Table 4: Comparison with the algorithm.

x
1 h
2 h
3 h
4 h
5 h
6 h
7 h
8 h
9 h
10 h

Algorithm (1)
0.000
0.000
0.0155
0.0318
0.0455
0.0575
0.0716
0.0992
0.0783
0.0069

Algorithm (2)
0.000
0.000
0.000
0.0011
0.0028
0.0043
0.0049
0.0042
0.0211
0.0263

G-algm
0.1255
0.1351
0.1385
0.1395
0.2452
0.2522
0.3836
0.3911
0.4263
0.5485

5.3. Numerical Test 3

The exact solution is ; we use algorithm 5 to solve this problem. The comparison between the exact and the numerical solution can be seen in Figure 2. One can see that the numerical solution is very accurate when , and the result is obtained in less than 50 steps. This is much more efficient than the algorithm.

Figure 2: Comparison between algorithm (5) and the exact solution.

6. Conclusion

We can construct numerical algorithms for solving the fractional initial value problem based on the Pade approximation of fractional derivative operators. Numerical tests show that this method is more efficient than the corresponding algorithms. Generally speaking, we can calculate more terms to achieve more accuracy when Grunwald–Letnikov-based method is employed, but that would lead to more computational work, while the algorithms derived from Pade approximation are proved to be more efficient.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

References

W. F. Ames, “Mathematics in science and engineering,” in Mathematics in Science and Engineering, Elsevier, Amsterdam, Netherlands, 1999.

R. Hilfer, Applications of Fractional Calculus in Physics, World Scientific Publishing Company, Singapore, 2000.

R. Metzler and J. Klafter, “The random walk’s guide to anomalous diffusion: a fractional dynamics approach,” Physics Reports, vol. 339, no. 1, pp. 1–77, 2000.

S. Wang and M. Xu, “Axial Couette flow of two kinds of fractional viscoelastic fluids in an annulus,” Nonlinear Analysis: Real World Applications, vol. 10, no. 2, pp. 1087–1096, 2009.

X. Jiang, X. M. Yu, X. Jiang, and X. M. Yu, “Fractional anomalous diffusion caused by an instantaneous point source in disordered fractal media,” in Proceedings of the Fourth International Conference on Fluid Mechanics, Dalian, China, 2004.

E. A. Abdel-Rehim, “Fundamental solutions of the fractional diffusion and the fractional fokkerplanck equations,” Journal of the Egyptian Mathematical Society, vol. 24, no. 3, pp. 337–347, 2016.

M. A. Noor, “Some iterative methods for solving nonlinear equations using homotopy perturbation method,” International Journal of Computer Mathematics, vol. 87, no. 1, pp. 141–149, 2010.

Y. Khan and Q. Wu, “Homotopy perturbation transform method for nonlinear equations using He’s polynomials,” Computers & Mathematics with Applications, vol. 61, no. 8, pp. 1963–1967, 2011.

J.-H. He, “Variational iteration method—a kind of non-linear analytical technique: some examples,” International Journal of Non-linear Mechanics, vol. 34, no. 4, pp. 699–708, 1999.

A. M. Wazwaz, “The variational iteration method for analytic treatment for linear and nonlinear odes,” Applied Mathematics and Computation, vol. 212, no. 1, pp. 120–134, 2009.

A. Yldrm, “Variational iteration method for modifed camassa-holm and degasperis-procesi equations,” International Journal for Numerical Methods in Biomedical Engineering, vol. 26, no. 2, pp. 266–272, 2010.

I. Podlubny, T. Skovranek, and B. Datsko, “Recent advances in numerical methods for partial fractional dikerential equations,” in Proceedings of the 2014 15th International Carpathian Control Conference (ICCC), Velke Karlovice, Czech Republic, May 2014.

A. Saadatmandi and M. Dehghan, “A new operational matrix for solving fractional-order differential equations,” Computers & Mathematics with Applications, vol. 59, no. 3, pp. 1326–1336, 2010.

D. Kai, N. J. Ford, and A. D. Freed, “Detailed error analysis for a fractional adams method,” Numerical Algorithms, vol. 36, no. 1, pp. 31–52, 2004.

A. A. Kilbas, H. M. Srivastava, and J. J. Trujillo, “Theory and applications of fractional differential equations,” in North-Holland Mathematics Studies, Elsevier, Amsterdam, Netherlands, 2006.

R. Scherer, S. L. Kalla, Y. Tang, and J. Huang, “The Grünwald-Letnikov method for fractional differential equations,” Computers & Mathematics with Applications, vol. 62, no. 3, pp. 902–917, 2011.

I. Petras, “Fractional derivatives, fractional integrals, and fractional differential equations in MATLAB,” in Engineering Education and Research Using MATLAB, IntechOpen, London, UK, 2011.

G. Shchedrin, N. Smith, A. Gladkina, L. D. Carr, Fractional Derivative of Composite Functions: Exact Results and Physical Applications, 2018.

I. Podlubny, Fractional Dikerential Equations, Elsevier, Amsterdam, Netherlands, 1999.

Y. Xu and Z. He, “The short memory principle for solving abel differential equation of fractional order,” Computers & Mathematics with Applications, vol. 62, no. 12, pp. 4796–4805, 2011.

G. A. Baker and P. Gravesmorris, Padé Approximants, Cambridge University Press, Cambridge, UK, Second edition, 1996.