#### Abstract

We consider to represent an algorithm for time-fractional Burgers’ equation utilizing the multiquadric-radial basis functions with the time-splitting technique. This algorithm is performed on the three examples. The numerical results indicated that the algorithm yields accurate approximate solutions of the time-fractional Burgers’ equation. The physical behavior of the obtained solutions is given with graphics, and the results showed that the obtained solutions are in good match with the solutions reported in the literature. The algorithm is accurate, flexible, and easy to implement.

#### 1. Introduction

We address the numerical solution of the one-dimensional fractional Burgers’ equation as follows:with the initial and boundary conditionsrespectively, where is Caputo fractional derivative; and are time and space parameters, respectively; is the viscosity constant; and , , and are known functions, and is sufficiently smooth. Here, are fractional derivatives in Caputo sense, defined by

The steady-state solutions of the classical Burgers’ equation are primarily computed in [1]. Burger [2] proposed to utilize classical Burgers’ equation for the turbulence model. Since then, Burgers’ equation has always been the focus of attention for researchers. Particularly, the development of the fractional derivative in recent years has required the fractional modeling of classical mathematical models. Burgers’ (1) is important one of such models. The reason why fractional derivative has been a hot topic lately is that it finds application in science and engineering in fields such as physics, biology, and control theory [3, 4]. When it was difficult for researchers to find analytical solutions for fractional differential equation models, error analyzes have been made by searching numerical solutions in general. The authors of [5] presented an approximate scheme for fractional differential equations which is based on the generalization of the Adams–Bashforth–Moulton method and then provided an exhaustive error analysis of this scheme. The authors of [6] tailored a fully discrete difference scheme for a diffusion-wave system and it is based on the transforming the governing equation into a low-order system of equations by defining two new variables. In [7], the author proves that the smooth solutions exist for the Caputo-type fractional differential equations. The author in [8] presented a scheme for the fractional differential equation. This scheme is tailored by combining the predictor-corrector scheme with the short memory principle. The authors of [9] analyzed the stability of the explicit multistep methods and derived novel schemes which enable a larger stability region. The local truncation error and the stability of the high-order compact finite difference scheme for the fractional diffusion equation are investigated in [10]. The fractional linear multistep and the finite element techniques are performed for time and space discretization, respectively, for the time-fractional subdiffusion equation in [11]. The convergence and stability analysis of the finite difference schemes for fractional differential equations are investigated in [12]. A numerical scheme based on the combination of the Alikhanov scheme and the Galerkin finite element methods for solving nonlinear time-fractional parabolic equations is proposed in [13]. A linear finite difference scheme is tailored for the numerical solutions of the generalized time-fractional Burgers equation in [14]. In [15, 16], the authors used lower- and higher-order classical time-splitting methods to solve Burgers’ equation. The authors of [17] presented three different time-splitting algorithms with the convergence and stability analysis for nonlinear time-fractional differential equations. In [12–16, 18–27], the authors proposed numerical schemes such as finite difference, finite elements, spectral methods, and radial basis functions to analyze the numerical solutions of the fractional Burgers’-type equations.

In this work, we propose an algorithm depending on the utilization of the multiquadric-radial basis functions and a splitting method for solving time-fractional Burgers’ equation numerically. By using advantage of a meshfree scheme in this algorithm, the goal is to get an approach that yields accurate results and exhibits the physical dynamics of the time-fractional Burgers’ equation.

The remainder of this article is organized as follows. In Section 2, the multiquadric-radial basis functions (MQ-RBF) used in this paper were introduced. Section 3 contains the time-splitting technique. In Section 4, the numerical results are presented to show the performance of the proposed algorithm. Finally, we give some concluding remarks in Section 5.

#### 2. The Multiquadric-Radial Basis Functions (MQ-RBFs)

In order to obtain a fractional-order differential equation system, we discretize equation (1) in space by performing the radial basis functions method [28, 29]. To do this, one can represent the numerical solution of equation (1), , as follows:where is continuously differentiable radial basis functions, represents the number of distributed nodes, is dimensional vector, and are needed to be defined by utilizing the collocation methods. On the other hand, we use the following MQ-RBF function:where is the shape constant and denoted by the Euclidean norm.

We define an approximate solution by and then writewhere , are uniformly distributed nodes on the range [0, 1], and

Equation (6) can be rewritten in the following form:where with for , and

By considering equations (4), (6), and (8), it follows

If one replaces equation (10) and its derivatives with the corresponding terms in equation (1) at the collocation nodes in [0, 1], then the following is obtained:where , is the Caputo derivative, ,

Notice that, the operator “∗” is defined for point-wise multiplication. Furthermore, equations (11) read in the form as follows:where .

#### 3. Time-Splitting Method

Splitting methods have received much attention due to their advantages such as speed, accuracy, and stability. These methods are explicit and easy to implement. Furthermore, splitting methods are designed as geometric numerical schemes. These schemes preserve some qualitative properties of the systems [30]. Let us consider following fractional differential equation:where is the Caputo derivative. The classical time-splitting method for one time step can be considered for equation (14) as follows:

That is, equation (14) is split into two equations which are solvable and easy to deal with separately. These two equations are solved successively. Let us denote as approximate solution of fractional equation (14) and then the error of the classical splitting methods is given as follows:

The order of convergence of the classical splitting method is . Thus, it can be said that the convergence order of the time-splitting scheme obtained for one step decreases as approaches zero. In order to solve this problem, the author of [17] developed a division method for the fractional nonlinear systems of ordinary differential equations. The order of the convergence of this new division method is and we perform this method to solve equation (13), with A is real matrices, Here, the continuous function fulfills the Lipschitz inequality, that is, on suitable domain

The Caputo derivative is defined by

For convenience, the following notations are used [17]:

To obtain splitting schemes, the time-fractional differential system equation (13) is written in the integral form as follows:

If one defines , , as uniformly distributed points on the range with , then equation (20) is written over as follows:

In order to tailor a splitting scheme, the author of [17] definedwhere the solution on is given and denoted with for .

The initial value of at is defined as follows:

Then, equation (22) reads

With equations (21) and (22), one haswhere

The solution for can be computed with repetitions of above processes.

Notice that from equations (23)–(26), one can reach equation (21). Thus, there is no splitting error.

With equations (23)–(26), one writes

The fully discrete time-splitting scheme can be tailored by discretization of equations (27)–(30). If one performs the weighted right-rectangle rule to equation (30), then the following is obtained:

Using equation (31) with equation (29) yieldswhere = , = , and . If one defines all known information in equation (32) by , then the following is obtained:

On the other hand, the integrals in equations (28) and (34) are computed by performing the weighted trapezoidal rule and the weighted midpoint rule with , respectively. However, the integrals in equations (27) and (33) are computed by utilizing the weighted right-rectangle rule and the weighted left-rectangle rule, respectively. Then, the following time-splitting scheme is obtained [17]:where

The following approach is performed to get equation (36):

This time-splitting scheme is called as TS-I and the following convergence theorem is valid [17].

Theorem 1 (see [17]). *Let and , , be the solution of equation (13) and the schemes equations (35)–(38), respectively. Let and .*

If and fulfills the Lipschitz inequality equation (17), then following equation holds:with a constants that is independent of . If then

#### 4. Numerical Results

To compare the performance of the mentioned algorithms for each test examples, the following absolute error and and error norms are used:

We consider to assign the shape constant using trial and error. We have used errors between exact and numerical solutions to determine the best value of shape parameters. As shown in Figure 1, the selection of its best value with corresponding smallest error. We compute error norm between exact and numerical solutions at the interval [0.01, 10] and compare them to specify the shape parameter.

*Example 1. *We first compute the approximate solutions of problem (1) satisfying the conditions as follows:whereThe exact solution is [19]A comparison of the errors between presented method and [19, 20] for Example 1 is given in Table 1 at with . The results are obtained with and , , and with corresponding shape parameter values , , and , respectively, for the present method. It is clear that as the viscosity value decreases, the errors become smaller as well as better than [19, 20]. In Table 2, we compare the numerical results with those of [31] for Example 1 at with . For the presented scheme, the computation was handled using , , for , , , respectively, and . It indicates that the results obtained with the presented algorithm are in good match with the exact solutions and absolute errors are better than those given in [31]. We have tabulated the numerical solutions for Example 1 at with , , and in Table 3. The shape parameters are , , and for , ,and , respectively. It shows that the approximate solutions are in good match with exact solutions and the absolute errors are small enough. Furthermore, Figures 2 and 3 show the behavior of the approximate solutions at and the absolute errors, respectively, with , , , and . Figure 2 shows that the obtained solutions are symmetric.

*Example 2. *In the next example, we deal with the time-fractional Burgers’ equation (1) subject to following condition:The exact solution is given as [32]with force termThe boundary conditions are computed by using the exact solution.

In Table 4, numerical solutions and absolute errors at are obtained by the present method for Example 2 with , , , and . Table 4 shows that the numerical solutions of the presented methods are highly accurate than the solutions tabulated in [32] with the same parameter values.

*Example 3. *As a final example, we investigate the numerical solutions of (1) satisfying the conditions as follows:The series solutions are obtained in [33] by performing the Hopf-Cole technique [34, 35] as follows:whereIn Table 5, numerical solutions and absolute errors at are computed by the present scheme for Example 3 with and . The shape parameters are chosen as , , and for , , and , respectively. Table 5 shows a good match between the obtained and the analytical results.

#### 5. Conclusions

A numerical algorithm based on the combination of the MQ-RBF and splitting technique is presented to investigate the solutions of the fractional Burgers’ equation, numerically. Instead of classical splitting methods, a division method for the fractional nonlinear systems of ordinary differential equations is performed. This method has order of convergence which is different from . That is, when tends to zero, the error does not increase significantly. Furthermore, this algorithm also takes advantage of a meshfree scheme. It is concluded that the present approach yields accurate results and exhibits physical dynamics of the time-fractional Burgers’ equation. This proposed scheme can be used for the other nonlinear fractional PDEs.

#### Data Availability

The data used to support the findings of this study are included within the article.

#### Conflicts of Interest

The authors declare that they have no conflicts of interest.

#### Authors’ Contributions

The authors completed this study and wrote and approved the final version of the manuscript.

#### Acknowledgments

The authors present their deepest thanks to Dr. Muaz Seydaoglu for his guidance on simulation and his careful reading of the revised version of the paper.