Application of Müntz Orthogonal Functions on the Solution of the Fractional Bagley–Torvik Equation Using Collocation Method with Error Stimate
Abstract
This paper uses Müntz orthogonal functions to numerically solve the fractional Bagley–Torvik equation with initial and boundary conditions. Müntz orthogonal functions are defined on the interval [0, 1] and have simple and distinct real roots on this interval. For the function f ∈ L2(0, 1), we obtain the best unique approximation using Müntz orthogonal functions. We obtain the Riemann–Liouville fractional integral operator for Müntz orthogonal functions so that we can reduce the complexity of calculations and increase the speed of solving the problem, which can be seen in the process of running the Maple program. To solve the fractional Bagley–Torvik equation with initial and boundary conditions, we use Müntz orthogonal functions and consider simple and distinct real roots of Müntz orthogonal functions as collocation points. By using the Riemann–Liouville fractional integral operator that we define for the Müntz orthogonal functions, the process of numerically solving the fractional Bagley–Torvik equation that is solved using Müntz orthogonal functions is reduced, and finally, we reach a system of algebraic equations. By solving algebraic equations and obtaining the vector of unknowns, the fractional Bagley–Torvik equation is solved using Müntz orthogonal functions, and the error value of the method can be calculated. The low error value of this numerical solution method shows the high accuracy of this method. With the help of the Müntz functions, we obtain the error bound for the approximation of the function. We have obtained the error bounds for the numerical method using which we solved the fractional Bagley–Torvik equation with initial and boundary conditions. Finally, we have given a numerical example to show the accuracy of the solution of the method presented in this paper. The results of solving this example using Müntz orthogonal functions and comparing the results with other methods that have been used the solve this example show the higher accuracy of the method proposed in this paper.
1. Introduction
To solve the fractional Bagley–Torvik equation, several numerical solutions and analytical solutions have been used. Hybrid functions approximation [1] fractional-order Legendre collocation method [2], Haar wavelet [3], Laplacetransform [4], Laguerre polynomials [5], shifted Chebyshev operational matrix [6], Legendre artificial neural network method [7], Chebyshev collocation method [8], the fractional Taylor method [9], exponential integrators [10], Gegenbauer wavelet method [11], Müntz–Legendre polynomials [12], discrete spline methods [13], Hermit solution [14], local discontinuous Galerkin approximations [15], numerical inverse Laplace transform [16], generalized Fibonacci operational tau algorithm [17], Jacobi collocation methods [18], polynomial least squares method [19], and fast multiscale Galerkin algorithm [20] are methods by which Bagley–Torvik equation solved numerically. In the study of Alshammari et al. [21], residual power series are used to obtain the numerical solution of a class of Bagley–Torvik problems in Newtonian fluid, and in the study of Karaaslan et al. [22], using the discontinuous Galerkin method that can be combined in the equation of motion of a plate immersed in a Newtonian fluid, the numerical solution of Bagley–Torvik equation has been discussed. Analytical solutions of the generalized Bagley–Torvik equation [23], Sumudu transformation method [24], generalized differential transform [25], Sine–Gordon expansion method, and Bernoulli equation method [26] are analytical solutions for solving the Bagley–Torvik equation in this work.
Several numerical techniques have been proposed for solving fractional integrodifferential equations, such as Legendre wavelet [27], Euler function [28], Chebyshev series [29], and also methods such as stable least residue [30], discrete Galerkin [31], homotopy perturbation [32], variational interaction [33], Runge–Kutta convolution quadrature [34], and Hermite spectral collocation [35].
The index (t) indicates the fractional derivative with respect to time. Equation (15) seems to be an unusual relationship between pressure and velocity, but using this method provides significant satisfaction in pressure–velocity relationships for Newtonian fluid. Equation (8) is a combination equation for a Newtonian fluid. Equation (15) describes the relationship between pressure and velocity in the fluid for any semi-infinite fluid domain and any allowed velocity at the boundary. The priority of this problem is to show the behavior of a real physical system using fractional derivatives [36].
This article is organized into six sections. In Section 1, the introduction is presented. Section 2 is devoted to the preliminary and practical definitions. In Section 3, Müntz orthogonal functions and the best unique approximation for the arbitrary function are introduced also the Riemann–Liouville fractional integral operator for the Müntz orthogonal functions is defined to shorten the process of solving the fractional Bagley–Torvik. Section 4 is dedicated to the method of numerical solution of the fractional Bagley–Torvik equation with initial-boundary conditions using orthogonal functions as well as the error bound of the presented method. In Section 5, a numerical example is given to demonstrate the efficiency and capability of the proposed method. Finally, Section 6 is allocated to the general conclusion.
2. Preliminaries and Notations
2.1. Fractional Integral and Derivative
Definition 1. The Riemann–Liouville fractional integral operator of the order α with the assumption and Iα in [a, b] is defined as follows [37]:
Definition 2. The Caputo fractional derivative operator of order α with the assumption and CDα is defined as follows [37]:
As it is obvious for and , the Caputo derivative and Riemann–Liouville integral satisfy the following properties [37]:
Definition 3. The two-scale fractal derivatives with dimensions α and β with respect to t and x, respectively, are defined as follows [38]:
Definition 4. The He’s fractional derivative defined as (0 < α ≤ 1) [39]
Definition 5. Suppose that f ∈ Hr(0, 1) with integers r ≥ 0 where [40]
3. Müntz Orthogonal Functions and Their Properties
3.1. Müntz Orthogonal Functions
Definition 6. The family is Müntz orthogonal functions and is defined as follows [43]:
Rn(t) and Sn(t) are algebraic polynomials of degree [n/2] and [(n − 1)/2], respectively, which are as follows:
If n = 2m is an even number, then for each 0 ≤ v ≤ m − 1, we have the following:
For v = m,
If n = 2m + 1 is an odd number, then for each 0 ≤ v ≤ m, we have the following:
Some Müntz orthogonal functions are shown as follows:
Table 1 shows the roots of Pn(t) for n = 1, 2, 3, 4, 5.
n | t1 | t2 | t3 | t4 | t5 |
---|---|---|---|---|---|
1 | 0.3678794412 | − | − | − | − |
2 | 0.06442096633 | 0.6374173264 | − | − | − |
3 | 0.01871588194 | 0.2651887508 | 0.7969679223 | − | − |
4 | 0.007047297639 | 0.1154772486 | 0.4569410332 | 0.8683835323 | − |
5 | 0.003221796109 | 0.05672067679 | 0.2565492462 | 0.5974812127 | 0.9100748739 |
Theorem 1. The Müntz orthogonal function Pn(t) for n = 0, 1, 2, …, has exactly n simple and distinct real root in [0, 1] [43].
3.2. Function Approximation Using Orthogonal Müntz Basis
3.3. Fractional Riemann–Liouville Integral Operator for Müntz Functions
4. Numerical Method and Its Error Estimation
4.1. Müntz Collocation Method
Remark 1. One of the problems of this method is to find the roots of Müntz orthogonal functions for large n. With the help of maple software, We calculated the for n ≤ 60 up to 50 meaningful digits and there was numerical stability.
4.2. Error Estimation
First consider the following lemma that will be used in deriving our main convergence results.
Lemma 1. Let be the best approximation of f in Y. Then, if r ≤ N + 1 we have the following:
Proof. Suppose that LNf be the truncated Legendre series of the function f, then according to Equation (5.4.11) in the study of Canuto et al. [44] for r ≤ N + 1 we have the following:
AS INf is the best approximation of f in L2−norm, we can write
Theorem 2. If f ∈ Hr(0, 1) and r ≥ 0 then the error bound EN for Equation (1) with the conditions given in Equation (2) is as following:
Proof. According to Equation (47), we have the following:
From Equation (16) and Equation (57), we have the following:
Similarly
Then Equation (61) is obtained based on Equations (57) and (62)–(64).
Theorem 3. If f ∈ Hr(0, 1) and r ≥ 0, the error bound for Equation (1) with the conditions in Equation (3) is as follows:
5. Numerical Example
In this section, a numerical example for solving the fractional Bagley–Torvik equation with initial-boundary conditions is given to show the efficiency and applicability of the numerical method in this paper.
Example 1. Consider following properties [1, 6]:
In the two-parameter Mittag-Leffler function with λ, μ > 0 indices, is equal to
By solving this example with the initial conditions and coefficients A = 1, B = 1/2, and C = 1/2 are considered, then the approximate values of the function f(t) are obtained. These approximate values in Table 2 are compared with the approximate values in the study of Mashayekhi and Razzaghi [1], which was obtained by using combined functions, and in the study of Ji et al. [6], which was obtained by using the shifted Chebyshev operational matrix. In Figure 1, the logarithmic values of the absolute errors for different values of N are depicted, which shows the exponential convergence.

t | Method [1] | Method [6] | Present method | Exact |
---|---|---|---|---|
(M = 3, N = 8) | (N = 16) | (N = 16) | ||
0.1 | 0.0364875 | 0.036487532 | 0.03648747992 | 0.03648747990 |
0.2 | 0.1406398 | 0.140639669 | 0.14063962121 | 0.14063962117 |
0.3 | 0.3074848 | 0.3074844733 | 0.30748462710 | 0.30748462713 |
0.4 | 0.5332842 | 0.533283636 | 0.53328410990 | 0.53328410988 |
0.5 | 0.8147568 | 0.814758247 | 0.81475694936 | 0.81475694938 |
0.6 | 1.1488372 | 1.148848315 | 1.14883742229 | 1.14883742227 |
0.7 | 1.5325655 | 1.532537770 | 1.53256542649 | 1.53256542650 |
0.8 | 1.9630293 | 1.963013767 | 1.96302925484 | 1.96302925484 |
0.9 | 2.4373338 | 2.437896842 | 2.43733397083 | 2.43733397084 |
1.0 | 2.9525839 | − | 2.95258387995 | 2.95258388004 |
Table 3 shows the results of the comparison of the method presented in this paper with the method in the study of Uddin and Ahmad [4], which is used to solve the fractional Bagley–Torvik equation using the Laplace transform. C1, C2, and C3 are three different paths for optimal parameters [4].
N | Method [4] | Method [4] | Method [4] | Present method |
---|---|---|---|---|
(C1) | (C2) | (C3) | ||
10 | 7.7161e − 3 | 4.9000e − 8 | 1.0000e − 9 | 9.6216e − 11 |
20 | 1.0552e − 5 | 1.0000e − 9 | 1.0000e − 9 | 2.0024e − 14 |
23 | 9.8800e − 7 | 1.0000e − 9 | 1.0000e − 9 | 3.1158e − 14 |
50 | 1.0000e − 9 | 1.0000e − 9 | 1.0000e − 9 | 3.2920e − 19 |
60 | 1.0000e − 9 | 1.0000e − 9 | 2.9000e − 8 | 2.9127e − 19 |
90 | 1.0000e − 9 | 2.0000e − 9 | 1.1000e − 1 | 2.2831e − 24 |
100 | 1.0000e − 9 | 1.3700e − 7 | 9.5387e − 0 | 1.3631e − 24 |
If the coefficients A = B = C = 1 are considered, the values of logarithmic values of absolute errors are shown in Figure 2. In Table 4, the absolute errors of the function f(t) for A = B = C = 1 using the method presented in this paper are compared with the method in the study of Mashayekhi and Razzaghi [1].

t | Method [1] | Present method |
---|---|---|
(M = 4, N = 8) | (N = 14) | |
0.5 | 2.4e − 9 | 1.2e − 10 |
1 | 8.4e − 9 | 1.0e − 9 |
2 | 6.3e − 8 | 2.3e − 9 |
5 | 2.8e − 4 | 1.2e − 6 |
Table 5 shows the results of the comparison of the method presented in this paper with the method in the study of Zolfaghari et al. [45], which is used to solve the fractional Bagley–Torvik equation using the homotopy perturbation method.
t | Method [45] | Present method | Exact |
---|---|---|---|
N = 10 | |||
0 | 0.0000 | 0.000000000 | 0.000000000 |
0.1 | 0.0335 | 0.033507355 | 0.033507310 |
0.2 | 0.1252 | 0.125221248 | 0.125221280 |
0.3 | 0.2677 | 0.267609447 | 0.267609420 |
0.4 | 0.4555 | 0.455435396 | 0.455435398 |
0.5 | 0.6843 | 0.684334730 | 0.684334753 |
0.6 | 0.9501 | 0.950392575 | 0.950392563 |
0.7 | 1.2494 | 1.249959149 | 1.249959133 |
0.8 | 1.5788 | 1.579557186 | 1.579557209 |
0.9 | 1.9351 | 1.935832303 | 1.965832293 |
1 | 2.3149 | 2.315525744 | 2.315525823 |
Moreover, by solving this example with the boundary conditions and coefficients A = 1, B = 1/2, and C = 1/2 are considered, then the approximate values of the function f(t) are obtained. In Table 6, approximate values are compared with exact values.
t | N = 10 | N = 30 | N = 60 | Exact |
---|---|---|---|---|
0.1 | 0.036487404375 | 0.036487479864 | 0.0364874799011 | 0.0364874799009 |
0.2 | 0.140639724816 | 0.140639621157 | 0.1406396211738 | 0.1406396211740 |
0.3 | 0.307484496274 | 0.307484627118 | 0.3074846271334 | 0.3074846271337 |
0.4 | 0.533284101747 | 0.533284109806 | 0.5332841098751 | 0.5332841098756 |
0.5 | 0.814757087316 | 0.814756949317 | 0.8147569493835 | 0.8147569493833 |
0.6 | 1.148837366742 | 1.148837422295 | 1.1488374222698 | 1.1488374222703 |
0.7 | 1.532565319887 | 1.532565426547 | 1.5325654264985 | 1.5325654264982 |
0.8 | 1.963029329581 | 1.963029254846 | 1.9630292548366 | 1.9630292548369 |
0.9 | 2.437333969513 | 2.437333970854 | 2.4373339708438 | 2.4373339708440 |
1.0 | 2.952583880039 | 2.952583880039 | 2.9525838800390 | 2.9525838800390 |
If the coefficients A = B = C = 1 are considered, in Table 7, the approximate values of function f(t) for N = 10, N = 30, and N = 60, are compared with its exact values. As we can see, increasing the value N leads to a low absolute error and high accuracy of the method, which proves the stability of the proposed method.
t | N = 10 | N = 30 | N = 60 | Exact |
---|---|---|---|---|
0.1 | 0.033507162346 | 0.0335073099353 | 0.0335073100169 | 0.0335073100166 |
0.2 | 0.125221479995 | 0.1252212803110 | 0.1252212803466 | 0.1252212803471 |
0.3 | 0.267609140575 | 0.2676094195004 | 0.2676094195331 | 0.2676094195339 |
0.4 | 0.455435400934 | 0.4554353974487 | 0.4554353975927 | 0.4554353975939 |
0.5 | 0.684335033706 | 0.6843347530036 | 0.6843347531505 | 0.6843347531500 |
0.6 | 0.950392421075 | 0.9503925632445 | 0.9503925632016 | 0.9503925632028 |
0.7 | 1.249958912764 | 1.2499591326644 | 1.2499591325649 | 1.2499591325644 |
0.8 | 1.579557379566 | 1.5795572087353 | 1.5795572087127 | 1.5795572087133 |
0.9 | 1.935832277274 | 1.9358322930399 | 1.9358322930172 | 1.9358322930176 |
1.0 | 2.315525822793 | 2.3155258227926 | 2.3155258227926 | 2.3155258227926 |
6. Conclusions
In this paper, we utilize Müntz orthogonal functions to provide the approximate solution of the fractional Bagley–Torvik equation subjected to initial-boundary conditions. First, the functional equations are introduced, which help to solve the problem effectively. Then the fractional integral operator is defined as Müntz orthogonal functions that shorten the solution of the Bagley–Torvik fractional equation in a system of algebraic equations. The roots of Müntz orthogonal functions on the interval [0, 1] are simple and distinct considered collocation points. Furthermore, solving these algebraic equations help us to approximate the desired function using Müntz orthogonal functions. In the end, several numerical examples with initial-boundary conditions are solved with this method. The results obtained by the present method are computationally more accurate compared with the existing methods for solving the fractional Bagley–Torvik equation.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Open Research
Data Availability
No data were used for the research described in the article.