#### Abstract

The main aim of this work is to consider a meshfree algorithm for solving Burgers’ equation with the quartic B-spline quasi-interpolation. Quasi-interpolation is very useful in the study of approximation theory and its applications, since it can yield solutions directly without the need to solve any linear system of equations and overcome the ill-conditioning problem resulting from using the B-spline as a global interpolant. The numerical scheme is presented, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the time derivative of the dependent variable. Compared to other numerical methods, the main advantages of our scheme are higher accuracy and lower computational complexity. Meanwhile, the algorithm is very simple and easy to implement and the numerical experiments show that it is feasible and valid.

#### 1. Introduction

Burgers’ equation plays a significant role in various fields, such as turbulence problems, heat conduction, shock waves, continuous stochastic processes, number theory, gas dynamics, and propagation of elastic waves [1–5]. The one-dimensional Burgers’ equation first suggested by Bateman [6] and later treated by Burgers [1] has the form where is the coefficient of kinematic viscosity and the subscripts and denote space and time derivatives. Initial and boundary conditions are where , , and will be chosen in a later section.

Burgers’ equation is a quasi-linear parabolic partial differential equation, whose analytic solutions can be constructed from a linear partial differential equation by using Hopf-Cole transformation [1, 2, 7]. But some analytic solutions consist of infinite series, converging very slowly for small viscosity coefficient . Thus, many researchers have spent a great deal of effort to compute the solution of Burgers’ equation using various numerical methods. Finite difference methods were presented to solve the numerical solution of Burgers’ equation in [8–11]. Finite element methods for the solution of Burgers’ equation were introduced in [12–15]. Recently, various powerful mathematical methods such as Galerkin finite element method [16, 17], spectral collocation method [18, 19], sinc differential quadrature method [20], factorized diagonal padé approximation [21], B-spline collocation method [22], and reproducing kernel function method [23] have also been used in attempting to solve the equation.

In 1968 Hardy proposed the multiquadric (MQ) which is a kind of radial basis function (RBF). In Franke’s review paper, the MQ was rated as one of the best methods among 29 scattered data interpolation and ease of implementation. Since Kansa successfully applied MQ for solving partial differential equation, more and more reasearchers have been attracted by this meshfree, scattered data approximation scheme [24]. The meshfree method uses a set of scattered nodes, instead of meshing the domain of the problem. It has been successfully applied to solve many physical and engineering problems with only a minimum of meshing or no meshing at all [25–30]. In recent years, many meshfree metheods have been developed, such as the element-free Galerkin method [31], the smooth particle hydrodynamics method [32], the element-free kp-Ritz method [33–36], the meshless local Petrov-Galerkin method [37], and the reproducing kernel particle method [38].

With the use of univariate multiquadric (MQ) quasi-interpolation, solution of Burgers’ equations was obtained by Chen and Wu [39]. Moreover, Hon and Mao [40] developed an efficient numerical scheme for Burgers’ equation applying the MQ as a spatial approximate scheme and a low order explicit finite difference approximation to the time derivation. Zhu and Wang [41] presented the numerical scheme for solving the Burgers’ equation, by using the derivative of the cubic B-spline quasi-interpolation to approximate the time derivative of the dependent variable and a low order forward difference to approximate the time derivative of the dependent variable. In this paper, we provide a numerical scheme to solve Bugers’ equation using the quartic B-spline quasi-interpolation. Then we do not require to solve any linear system of equation so that we do not meet the question of the ill-condition of the matrix.Therefore, we can solve the computational time and decrease the numerical error.

This paper is arranged as follows. In Section 2, the definition of quartic B-spline has been described and univariate quartic B-spline quasi-interpolants have been presented. In Section 3, we mainly propose the numerical techniques using quartic B-spline interpolation to solve Burgers’ equation. In Section 4, numerical examples of Burgers’ equation are presented and compared with those obtained with some previous results. At last, we conclude the paper in Section 5.

#### 2. Univariate Quartic B-Spline Quasi-Interpolant

For an interval , we introduce a set of equally-spaced knots of partition . We assume that , , , and . Let be the space of continuously-differentiable, piecewise, quartic-degree polynomials on . A detailed description of B-spline functions generated by subdivision regarding the B-splines basis in can be found in [45].

The zero degree B-spline is defined as and, for positive constant , it is defined in the following recursive form:

We apply this recursion to get the quartic B-spline , which is defined in as follows:As usual, we add multiple knots at the endpoints: and .

In [24], univariate quartic B-spline quasi-interpolants can be defined as operators of the form The coefficients are listed as follows: and , , . For , we have the error estimate

We use to denote the space of polynomials of the total degree at most . In general, we impose that is exact on the space ; that is, for all . As a consequence of this property, the approximation order of is on smooth functions. In this paper, the coefficient is a linear combination of discrete values of at some points. The main advantage of is that they have a direct construction without solving any system of linear equations. Moreover, they are local in the sense that values of depend only on values of in a neighborhood of . Finally, they have a rather small infinity norm and, therefore, are nearly optimal approximant.

Differentiating interpolation polynomials leads to the classic finite difference for the approximate computation of derivatives. Therefore, we can draw a conclusion of approximating derivatives of by derivatives of . The general theory will be developed elsewhere. We can evaluate the value of at by and . and can be computed by the formula of B-spline’s derivatives as follows: where

By some trivial computations, we can obtain the value of at the knots, which are illustrated in Table 1. Then, we get the differential formulas for quartic B-spline QIs as

#### 3. Numerical scheme Using the Meshfree Quasi-Interpolation

In this section, we present the numerical scheme for solving Burgers’ equation based on the quartic B-spline quasi-interpolation.

Discretizing the Burgers’ equation in time with meshlength , we get

We can get where is the approximation of the value of at the point . Then, we can use the derivatives of the quartic B-spline quasi-interpolant to approximate and . To dump the dispersion of the scheme, we define a switch function , whose values are and at the discrete points , as follows: where . Thus, the resulting numerical scheme is

Starting from the initial condition, we can compute the numerical solution of Burgers’ equation step by step using the B-spline quasi-interpolation scheme (16) and formulas (11).

#### 4. Numerical Results

To investigate the applicability of the quasi-interpolation method to Burgers’ equation, four selected example problems are studied. To show the efficiency of the present method for our problem in comparison with the exact solution, we use the following norms to assess the performance of our scheme:

*Example 1. *Burgers’ equation is solved over the region and the initial and boundary conditions are given in Asaithambi [42]:
and the exact solution of this problem has the following nice compact closed-form, as given by Wood [46]:

In this computational study, we set , , . The comparison of the numerical solutions obtained by the present method, at the different coefficient of kinematic viscosity , are presented with the solutions obtained by Asaithambi [42] and the exact solution in Table 2.

*Example 2. *In this example, we consider the exact solution of Burgers’ equation [47]:
where , , , and are constants. The boundary conditions are
and initial condition is used for the exact solution at .

We solve the problem with , , and by our method. In Table 3, and errors at the time level are compared with the error obtained by Chen and Wu [39], Zhu and Wang [41], Da et al. [17], and Saka and Da [43]. For comparison, the parameters are adopted as time step , space step , and viscosity coefficient . From Table 3, we can find that our method provides better accuracy than most methods through the and error norms. The profiles of initial wave and its propagation are depicted at some times in Figure 1.

*Example 3. *Consider Burgers’ equation with the initial condition
and the boundary conditions

The analytical solution of this problem was given by Cole [2] in the term of an infinite series as with the Fourier coefficients

In Table 4, we have computed the numerical solutions of this example at differential time levels with parameter values , , and . The comparison of our results with the exact solutions as well as the solutions obtained in [11, 15, 44] is reported in Table 4. From Table 4, we can find that the presented scheme provides better accuracy. Moreover, in Tables 5, 6 and 7, we compare our method with Hon and Mao’s scheme, Chen and Wu’s MQQI method, and Zhu’s BSQI method at with , for , respectively. For the MQQI method, the shape parameter , , for Table 5, respectively, as [39]. Solutions found with the present method are in good agreement with the result and better than other methods. These show that the method works well.

*Example 4. *We consider particular solution of Burgers’ equation:
where . Initial condition is obtained from when is used. Boundary conditions are . Analytical solution represents shock-like solution of the one-dimensional Burgers’ equation. Parameters and are selected for comparison over the domain . Accuracy of our method is shown by calculating the error norms. These together with some previous results are given in Table 8. Table 8 shows that our method provides better accuracy than MQQI method and BSQI method. Although the accuracy is not higher than that of QBCM method, we know that, at each time step, the complexity of our method is lower than theirs. The numerical solutions are depicted with , , and for in Figure 2.

#### 5. Conclusion

Following the recent development of the quasi-interpolation method for scattered data interpolation and the meshfree method for solving partial differential equations, this paper combines these ideas and proposes a new meshfree quasi-interpolation method for Burgers’ equation. The method does not require solving a large size matrix equation and, hence, the ill-conditioning problem from using B-spline functions as global interpolants can be avoided. We have made comparison studies between the present results and the exact solutions. The agreement of our numerical results with those exact solutions is excellent. For the high-dimensional Burgers’ equations, we believe our scheme can also be applicable. In this case, we would use multivariate spline quasi-interpolation instead of univariate spline quasi-interpolation. We will consider these problems in our future work.

#### Conflict of Interests

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

#### Acknowledgments

This work is supported by the Disciplinary Construction Guide Foundation of Harbin Institute of Technology at Weihai (no. WH20140206) and the Scientific Research Foundation of Harbin Institute of Technology at Weihai (no. HIT(WH)201319).