Research Article | Open Access

Volume 2012 |Article ID 254086 | 15 pages | https://doi.org/10.5402/2012/254086

# Taylor's Meshless Petrov-Galerkin Method for the Numerical Solution of Burger's Equation by Radial Basis Functions

Accepted26 Oct 2011
Published01 Feb 2012

#### Abstract

During the last two decades, there has been a considerable interest in developing efficient radial basis functions (RBFs) algorithms for solving partial differential equations (PDEs). In this paper, we introduce the Petrov-Galerkin method for the numerical solution of the one-dimensional nonlinear Burger equation. In this method, the trial space is generated by the multiquadric (MQ) RBF and the test space is generated by the compactly supported RBF. In the time discretization of the equation, the Taylor series expansion is used. This method is applied on some test experiments, and the numerical results have been compared with the exact solutions. The , , and root-mean-square (RMS) errors in the solutions show the efficiency and the accuracy of the method.

#### 1. Introduction

Burger's equation serves as a useful model for many interesting problems in applied mathematics and related sciences. It is in the models of effectively certain problems of a fluid flow nature, wherein either shocks or viscous dissipation is a significant factor.

The first steady-state solution of Burger's equation were given by Bateman  in 1915. However, the equation gets its name from the extensive research of Burgers  beginning in 1939. This equation has a large variety of applications in modeling of water in unsaturated soil, dynamics of soil water, statistics of flow problems, mixing and turbulent diffusion, cosmology, and seismology .

In one-dimension case, Burger's equation is given by where is a viscosity constant and the subscripts and denote the space and time differentiations, respectively. The initial condition and the boundary conditions are given by

Various numerical methods have been introduced to solve Burger's equation, such as cubic splines and finite differences , compact differencing method [7, 8], finite element method (FEM) , the Tau method , and the method of lines .

Many of these methods need the mesh generation and provide the solution of the problem on mesh points. But in recent years, other methods, namely, meshless methods, have been provided, which do not need to generate the mesh. In a meshless method, a set of scattered nodes is used instead of meshing the domain of the problem. A powerful tool for the scattered data interpolation problem is the RBFs. In the last two decades, the development of the RBFs as a truly meshless method for approximating the solutions of PDEs has drown the attention of many researchers in science and engineering. The initial development was due to the pioneering work of Kansa [12, 13] who directly collocated the RBFs for the approximated solution of the equations.

To date, useful meshless methods have been provided for the nonlinear PDEs, wherein the RBFs are used, such as the collocation method for solving Burger's equation , Korteweg-de Vries equation [15, 16], and sine-Gordon equation .

In this paper, we present the other meshless method, which is called the meshless local Petrov-Galerkin (MLPG) method. This method was first introduced by Atluri and Zhu . The MLPG method is very general, can be based on the symmetric or unsymmetric local weak forms of the PDEs, and uses a variety of interpolation method for test and trial functions. Hence, we use the local unsymmetric weak form of the problem, and the MQ RBF and the compactly supported RBF are chosen as the trial and the test functions, respectively.

In classical methods, using low order time integration for transient problems may cause loss in the accuracy of the numerical schemes. On the other hand, increasing the order of time discretization can yield better results. The main idea behind the present time integration is to use more time derivatives in the Taylor series expansion. Recently, Daĝ et al.  have developed the Taylor-Galerkin and the Taylor-collocation methods for the numerical solution of Burger's equation by B-splines. The objective of the present paper is to obtain the numerical solution of Burger's equation by combining the MLPG method with the aforesaid time discretization of the Taylor series expansion that according to the best of our knowledge, this is the first demonstration of the application of it.

The paper is organized as follows. A brief knowledge of the RBFs interpolation is given in Section 2. In Section 3, the time discretization of Burger's equation is introduced, and in Section 4, the MLPG method is presented. In Section 5, we give several numerical experiments to demonstrate the accuracy and efficiency of our meshless numerical scheme, and Section 6 contains some conclusion.

#### 2. Radial Basis Function Interpolation

In order to explain multivariate scattered data interpolation by RBFs, suppose a data vector of function values, sampled from an unknown function at a scattered finite point set , is given. Scattered data interpolation requires computing a suitable interpolant satisfying , that is,

To this end, the RBF interpolation scheme works with a fixed radial function , and the interpolant in (2.1) is assumed to have the form where denotes the Euclidean distances and form a basis for the -dimensional linear space of polynomials of total degree less than or equal to in variables.

Since enforcing the interpolation conditions in (2.1) leads to a system of linear equations in the unknowns and , one usually adds the additional conditions

In general, solving the interpolation problem based on the extended expansion (2.2), now amounts of solving a system to linear equations of the form: where the pieces are given by , , ,  and 0 is a zero vector of length .

From [20, 21], we know that we have a unique interpolant of if is a conditional positive definite RBF of order . The commonly used RBFs are MQ, Gaussian, and compactly supported RBFs, see Table 1. The MQ has been found to provide the most accurate approximation in most of the applications of the RBFs . For the MQ RBF, , we have . In this case and for the one-dimensional space, the linear basis function is given by . Therefore, in one-dimensional and for the MQ approximation scheme, (2.2) yields the following expansion: and (2.3) yields From this equation, we obtain Substituting (2.7) into (2.5) yields or in the compact form, we obtain where the basis functions are given by

 Radial basis functions 𝜙 ( 𝑟 ) Parameters Order Gaussian e x p ( − 𝑐 𝑟 2 ) 𝑐 > 0 𝑚 ≥ 0 Multiquadrics ( − 1 ) ⌈ 𝛽 ⌉ ( 𝑐 2 + 𝑟 2 ) 𝛽 𝛽 > 0 , 𝛽 ∉ ℕ 𝑚 ≥ ⌈ 𝛽 ⌉ Inverse multiquadrics ( 𝑐 2 + 𝑟 2 ) 𝛽 𝛽 < 0 𝑚 ≥ 0 Polyharmonic splines ( − 1 ) ⌈ 𝛽 / 2 ⌉ 𝑟 𝛽 𝛽 > 0 , 𝛽 ∉ 2 ℕ 𝑚 ≥ ⌈ 𝛽 / 2 ⌉ Polyharmonic splines ( − 1 ) 𝑘 + 1 𝑟 2 𝑘 l o g ( 𝑟 ) 𝑘 ∈ ℕ 𝑚 ≥ 𝑘 + 1 Compactly supported ( 1 − 𝑟 ) 4 + ( 1 + 4 𝑟 ) 𝑑 ≤ 3 𝑚 ≥ 0

For more details about RBFs, see .

The variable in the MQ RBF, , wherein is replaced by , is known as the shape parameter controls the shape of the functions. The shape parameter influences the solution profoundly. Since the exact value of cannot be calculated, empirical studies have been made by researchers in the past to obtain a suitable value for the shape parameter . There are many methods for choosing the optimal value of , such as the brute force method  and the leave-one-out cross-validation (LOOCV) algorithm . Some other methods for finding the optimal shape parameter were produced by Kansa and Hon , Hardy , and Franke .

In this paper, we use the value of the shape parameter that is suggested by Hardy . Hardy suggested the value where is the distance from the th center to the nearest neighbor and is the number of centers.

#### 3. Time Discretization

For the time discretization of (1.1), we use the Taylor series expansion. In this approach, the term , , is arranged with the help of the Taylor series expansion as Differentiating (1.1) with respect to time, may be written by For the time derivative in (3.2), using forward difference formula, can be rewritten as Substituting (3.3) into (3.1) and using the resulting expression in (1.1) yield the following time-discretized form of Burger's equation:

#### 4. The Meshless Local Petrov-Galerkin Method

The MLPG approach was first proposed by Atluri and Zhu  for solving linear potential problems, by using domain discretization technique. The MLPG approach uses either a local symmetric weak form, or an unsymmetric weak form of the governing equation over the local subdomain.

In the application of a local Petrov-Galerkin scheme to the Burger's equation, (3.4) is multiplied with the weight function and the resulting equation is integrated over the local subdomain such as , which is a small region taken for each node in the global domain . Therefore, the local weak form, is obtained which requires to be twice differentiable and to be continuous. If not, will be infinity where is discontinuous and (4.1) makes no sense. On the other hand, there is no continuity requirement on the weight function in (4.1). Thus, the requirements on and are unsymmetric, in order to be admissible in (4.1). Hence, we denote (4.1) as a local unsymmetric weak form (LUWF). The weight function is often referred to as the test function. In (4.1), is a local subdomain associated with the point .

In this paper, the compactly supported RBFs are chosen as the test functions. In this case, is support of the compactly supported RBFs. The compactly supported RBFs are generally expressed in the form (Wu  and Wendland ), and where is a prescribed polynomial. By replacing with for , the basis function has support on . In the numerical results for compactly supported RBF, the Wendland function is used as follow:

In LUWF (4.1), the collocation approach is used to impose both the essential as well as natural boundary conditions. The 10-point Gauss quadrature rule  is used for the numerical integration of (4.1).

#### 5. Numerical Experiments

Three test experiments are studied to investigate the robustness and the accuracy of the proposed method. The , , and RMS errors, which are defined by are used to measure the accuracy wherein is the approximate solution and is the exact solution of (1.1).

The computations associated with the experiments discussed above were performed in Maple 13 on a PC with a CPU of 2.4 GHZ.

Experiment 1. In this experiment, we consider the shock propagation solution of Burger's equation  as a numerical experiment. This solution is given by Initial condition of the problem is obtained from (5.2) at time , and boundary conditions in (1.3) can be obtained from the exact solution. Propagation of the shock is studied with the parameters and over the solution domain . The computational results are listed in Tables 2, 3, and 4. We also plot the profiles of the solutions at , and 2.4 in Figure 1. Figure 2 represents the percentage absolute error at different time levels. Figure 3 represents the percentage absolute error for various values of at the time of Experiment 1.
According to Table 3, we observe that first the value of errors decrease, but for these values increase. When we add center points in order to improve the accuracy, the condition number of the interpolation matrix grows and then the problem becomes ill-conditioned. The ill-conditioning grows due to the decrease in the distance between points, and not to the increase in the number of center points .

 𝑥 Exact solution Approximation solution Absolute error 0.1 0.0499996616 0.0499026831 0.0000969784 0.2 0.0999985674 0.0999517703 0.0000467971 0.3 0.1499924999 0.1500053758 0.0000128759 0.4 0.1999424670 0.2000195386 0.0000770716 0.5 0.2493193396 0.2492266449 0.0000926947 0.6 0.2877130559 0.2859612890 0.0017517669 0.7 0.1665563722 0.1653680358 0.0011883364 0.8 0.0083625462 0.0095237900 0.0178863362 0.9 0.0001370197 0.0002155982 0.0000785785 1.0 0.0000013175 −0.000007072 0.0000083903 1.1 7 . 6 0 5 3 7 4 𝑒 − 9 −0.000008593 0.0000086008
 𝑁 𝐿 2 𝐿 ∞ RMS 10 1 . 8 4 8 0 5 7 0 5 5 𝑒 − 2 3 . 9 2 5 6 6 4 3 4 𝑒 − 2 1 . 6 0 0 4 6 4 3 5 8 𝑒 − 2 20 2 . 0 6 7 8 1 0 7 3 8 𝑒 − 3 5 . 8 7 0 9 8 1 9 0 𝑒 − 3 1 . 8 3 9 8 4 8 0 8 8 𝑒 − 3 30 9 . 9 2 2 8 3 7 8 0 6 𝑒 − 4 2 . 9 3 6 1 9 8 8 2 𝑒 − 4 8 . 9 0 6 0 1 9 4 9 0 𝑒 − 4 40 1 . 0 0 0 8 3 4 8 4 8 𝑒 − 3 3 . 3 0 8 2 4 8 9 0 𝑒 − 3 9 . 0 2 1 4 0 3 4 0 1 𝑒 − 4
 𝑡 𝐿 2 𝐿 ∞ RMS 1.1 6 . 6 8 9 0 9 3 1 𝑒 − 4 2 . 4 4 9 0 4 6 7 𝑒 − 3 6 . 0 0 3 6 4 4 8 𝑒 − 4 1.3 7 . 9 3 1 9 3 7 2 𝑒 − 4 2 . 4 7 0 1 5 8 1 𝑒 − 3 7 . 1 1 9 1 3 1 5 𝑒 − 4 1.5 9 . 1 9 7 2 2 6 8 𝑒 − 4 2 . 6 3 0 8 6 4 6 𝑒 − 3 8 . 2 5 4 7 6 3 7 𝑒 − 4 1.7 9 . 9 2 2 8 3 7 8 𝑒 − 4 2 . 9 3 6 1 9 8 8 𝑒 − 3 8 . 9 0 6 0 1 9 4 𝑒 − 4 1.9 1 . 0 2 9 4 3 6 3 𝑒 − 3 2 . 9 2 4 7 2 8 4 𝑒 − 3 9 . 2 3 9 4 7 4 0 𝑒 − 4 2.1 1 . 0 4 1 7 3 8 2 𝑒 − 3 3 . 1 3 8 6 6 7 9 𝑒 − 3 9 . 3 4 9 8 8 7 1 𝑒 − 4 2.3 1 . 0 4 0 6 7 5 3 𝑒 − 3 3 . 2 5 7 4 1 5 8 𝑒 − 3 9 . 3 4 0 3 4 6 7 𝑒 − 4 2.5 1 . 0 3 9 0 6 2 4 𝑒 − 3 3 . 1 5 7 5 8 4 0 𝑒 − 3 9 . 3 2 5 8 7 0 7 𝑒 − 4

Experiment 2. In this experiment, we consider Burger's equation (1.1) with exact solution , where the parameters , and are arbitrary constants. Initial condition of the problem is obtained from (5.3) at time , and boundary conditions in (1.3) can be obtained from the exact solution. We study this experiment with parameters , and . The computational results are listed in Tables 5, 6, and 7. We also plot profiles of the percentage absolute error at different time levels in Figure 4.

 𝑡 𝐿 2 𝐿 ∞ RMS 0.3 7 . 4 2 9 1 1 5 1 8 2 𝑒 − 5 1 . 3 9 6 7 3 3 𝑒 − 4 7 . 0 8 3 3 8 3 3 9 7 𝑒 − 5 0.5 7 . 3 8 2 2 2 0 3 9 3 𝑒 − 5 1 . 3 8 2 5 0 1 𝑒 − 4 7 . 0 3 8 6 7 0 9 7 0 𝑒 − 5 0.7 7 . 3 0 9 6 2 9 3 5 0 𝑒 − 5 1 . 3 6 2 4 5 6 𝑒 − 4 6 . 9 6 9 4 5 8 1 2 6 𝑒 − 5 0.9 7 . 2 3 9 6 5 8 2 0 4 𝑒 − 5 1 . 3 4 0 4 6 6 𝑒 − 4 6 . 9 0 2 7 4 3 2 5 6 𝑒 − 5 1.1 7 . 1 7 6 1 2 8 4 4 3 𝑒 − 5 1 . 3 1 7 0 9 5 𝑒 − 4 6 . 8 4 2 1 7 0 0 0 6 𝑒 − 5 1.3 7 . 1 1 9 7 5 2 3 2 0 𝑒 − 5 1 . 2 9 2 5 0 8 𝑒 − 4 6 . 7 8 8 4 1 7 4 8 2 𝑒 − 5
 𝑥 Exact solution Approximation solution Absolute error 0.1 0.6497412010 0.6498740944 0.0003289340 0.2 0.6418463275 0.6419327944 0.0000864669 0.3 0.6339183523 0.6339885286 0.0000701763 0.4 0.6259634450 0.6260053930 0.0000419480 0.5 0.6179878599 0.6180048280 0.0000169681 0.6 0.6099979174 0.6099885933 0.0000093241 0.7 0.6019999834 0.6019588683 0.0000411151 0.8 0.5940004500 0.5939363938 0.0000640562 0.9 0.5860057138 0.5858875983 0.0001181155
 𝑁 𝑡 𝐿 2 𝐿 ∞ RMS 10 0.3 1 . 4 9 3 0 1 9 3 9 5 𝑒 − 2 2 . 8 3 7 9 8 5 7 𝑒 − 2 1 . 4 1 6 4 0 2 5 6 4 𝑒 − 2 0.5 2 . 0 9 1 6 1 9 4 5 9 𝑒 − 2 3 . 7 5 2 5 6 0 8 𝑒 − 3 1 . 9 8 4 2 8 4 4 4 7 𝑒 − 3 0.7 2 . 4 7 7 9 3 3 4 5 0 𝑒 − 2 4 . 3 3 8 7 3 2 3 𝑒 − 2 2 . 3 5 0 7 7 4 0 7 8 𝑒 − 2 20 0.3 2 . 0 1 7 3 6 3 6 4 7 𝑒 − 5 3 . 8 5 6 0 6 4 3 𝑒 − 5 2 . 0 1 7 3 6 3 6 4 7 𝑒 − 5 0.5 1 . 9 8 9 0 7 9 0 2 3 𝑒 − 5 3 . 7 8 3 6 2 0 1 𝑒 − 5 9 . 3 8 7 1 4 4 1 7 0 𝑒 − 5 0.7 1 . 9 1 7 9 4 1 8 1 7 𝑒 − 5 3 . 6 9 6 7 4 2 1 𝑒 − 5 1 . 8 6 9 3 7 8 4 4 6 𝑒 − 5 30 0.3 8 . 8 3 4 3 4 8 1 2 3 𝑒 − 6 1 . 4 2 7 4 9 3 4 𝑒 − 5 8 . 6 8 5 8 6 1 1 0 9 𝑒 − 6 0.5 7 . 4 1 3 3 1 2 5 8 5 𝑒 − 6 1 . 3 8 2 4 3 1 2 𝑒 − 5 7 . 2 8 8 7 1 0 2 2 2 𝑒 − 6 0.7 6 . 3 8 3 1 6 8 8 6 5 𝑒 − 6 1 . 3 3 1 5 4 0 4 𝑒 − 5 6 . 2 7 5 8 8 1 0 7 5 𝑒 − 6

Experiment 3. In this experiment, we study (1.1) with the exact solution , with The initial function in (1.2) is obtained from (5.4) at time . The boundary functions and in (1.3) can be obtained from the exact solution. The computational results are listed in Tables 8, 9, and 10. Figure 5 represents the and norm errors for with various values of in Experiment 3.

 𝑡 𝐿 2 𝐿 ∞ RMS 0.1 1 . 6 1 7 4 9 0 5 2 0 𝑒 − 3 2 . 1 8 7 2 5 8 6 𝑒 − 3 5 . 7 6 5 3 4 7 4 0 6 𝑒 − 3 0.2 2 . 1 9 1 3 6 1 1 9 9 𝑒 − 3 3 . 0 0 3 6 0 3 4 𝑒 − 3 2 . 1 3 5 8 7 4 6 9 4 𝑒 − 3 0.3 2 . 4 0 8 9 7 8 3 8 4 𝑒 − 3 3 . 3 1 2 0 9 3 4 𝑒 − 3 2 . 3 4 7 9 8 1 6 8 9 𝑒 − 3 0.4 2 . 5 0 2 2 7 7 2 0 0 𝑒 − 3 3 . 4 4 3 6 1 3 5 𝑒 − 3 2 . 4 3 8 9 1 8 1 2 6 𝑒 − 3 0.5 2 . 5 5 1 4 9 2 0 8 6 𝑒 − 3 3 . 5 1 2 4 4 0 4 𝑒 − 3 2 . 4 8 6 8 8 6 8 6 3 𝑒 − 3 0.6 2 . 5 8 4 3 2 4 4 8 6 𝑒 − 3 3 . 5 5 8 0 1 8 6 𝑒 − 3 2 . 5 1 8 8 8 7 9 2 8 𝑒 − 3 0.7 2 . 6 1 0 3 0 6 0 4 7 𝑒 − 3 3 . 5 9 3 9 2 1 8 𝑒 − 3 2 . 5 4 4 2 1 1 6 2 2 𝑒 − 3 0.8 2 . 6 3 2 6 8 5 4 0 3 𝑒 − 3 3 . 6 2 4 7 7 8 0 𝑒 − 3 2 . 5 6 6 0 2 4 3 2 0 𝑒 − 3 0.9 2 . 6 5 2 5 4 5 7 9 4 𝑒 − 3 3 . 6 5 2 1 3 1 7 𝑒 − 3 2 . 5 8 5 3 8 1 8 3 4 𝑒 − 3 1 2 . 6 7 0 2 2 1 1 0 1 𝑒 − 3 3 . 6 7 6 4 6 2 1 𝑒 − 3 2 . 6 0 2 6 0 9 5 9 2 𝑒 − 3
 𝑥 Exact solution Approximation solution Absolute error 0.1 0.6341806242 0.6331762537 0.0010043705 0.2 0.6272831040 0.6252326570 0.0020504470 0.3 0.6203506694 0.6174954438 0.0028552256 0.4 0.6133869804 0.6099911083 0.0033958721 0.5 0.6063957668 0.6027394214 0.0036563454 0.6 0.5993808174 0.5957602017 0.0036206157 0.7 0.5923459753 0.5890736196 0.0032723557 0.8 0.5852951233 0.5827004257 0.0025946976 0.9 0.5782321803 0.5766664052 0.0015657751
 𝜇 𝑡 𝐿 2 𝐿 ∞ RMS 0.5 0.2 6 . 5 8 5 6 7 1 1 9 1 𝑒 − 3 8 . 9 2 5 4 1 5 5 𝑒 − 3 6 . 4 1 8 9 1 8 2 7 2 𝑒 − 3 0.4 9 . 0 9 2 7 0 0 1 0 0 𝑒 − 3 1 . 2 4 8 3 1 4 0 𝑒 − 2 8 . 8 6 2 4 6 7 7 9 1 𝑒 − 3 0.6 1 . 0 1 1 9 2 1 0 2 8 𝑒 − 2 1 . 3 9 3 2 0 7 0 𝑒 − 2 9 . 8 6 2 9 8 6 1 5 0 𝑒 − 3 0.8 1 . 0 5 4 9 2 7 6 6 3 𝑒 − 2 1 . 4 5 6 2 5 0 1 𝑒 − 2 1 . 0 2 8 2 1 6 2 9 8 𝑒 − 2 1.5 0.2 1 . 0 5 7 6 9 2 7 1 0 𝑒 − 3 1 . 4 5 2 9 4 4 7 𝑒 − 3 1 . 0 3 0 9 1 1 3 3 3 𝑒 − 3 0.4 1 . 1 1 8 2 1 4 4 8 7 𝑒 − 3 1 . 5 3 8 2 5 3 7 𝑒 − 3 1 . 0 8 9 9 0 0 6 6 3 𝑒 − 3 0.6 1 . 1 3 6 7 4 1 3 3 2 𝑒 − 3 1 . 5 6 3 8 0 7 9 𝑒 − 3 1 . 1 0 7 9 5 8 3 9 8 𝑒 − 3 0.8 1 . 1 5 2 2 7 1 6 2 2 𝑒 − 3 1 . 5 8 5 1 5 4 3 𝑒 − 3 1 . 1 2 3 0 9 5 4 5 3 𝑒 − 3 3 0.2 2 7 6 4 8 0 8 1 9 7 𝑒 − 4 3 . 7 9 3 0 5 2 𝑒 − 4 2 . 6 9 4 8 0 1 6 8 9 𝑒 − 4 0.4 2 . 7 9 2 6 4 2 4 8 0 𝑒 − 4 3 . 8 3 1 3 8 6 𝑒 − 4 2 . 7 2 1 9 3 1 1 9 3 𝑒 − 4 0.6 2 . 8 1 5 3 8 8 9 6 4 𝑒 − 4 3 . 8 6 2 5 5 2 𝑒 − 4 2 . 7 4 4 1 0 1 7 2 3 𝑒 − 4 0.8 2 . 8 3 7 3 8 3 5 9 5 𝑒 − 4 3 . 8 9 2 6 8 3 𝑒 − 4 2 . 7 6 5 5 3 9 4 3 7 𝑒 − 4

#### 6. Conclusion

In this paper, we present a new meshless method, the MLPG method, for solving Burger's equation. The Wendland compactly supported RBF is used as the test function in the local weak form, and in time discretization, the Taylor series expansion is used. Results of numerical experiments indicate that it is an accurate and efficient numerical scheme. The proposed method is a truly meshless method, which does not require domain elements in the interpolation. In the weak form, integrals are evaluated over the local subdomain instead of the global domain. This method can be extended to solve Burger's equation in the higher-order dimensions because the MQ RBF can easily be extended to higher dimensions. Also, because of the infinite differentiability of the RBFs, we can use the MLPG method for the PDEs with higher-order derivatives with respect to , for example, the Korteweg-de Vries equation.

1. H. Bateman, “Some recent researches on the motion of fluids,” Monthly Weather Review, vol. 43, 1915. View at: Google Scholar
2. J. M. Burgers, “Mathematical examples illustrating relations occurring in the theory of turbulent fluid motion,” Transactions of the Royal Dutch Academy of Sciences in Amsterdam, vol. 17, no. 2, pp. 1–53, 1939. View at: Google Scholar | Zentralblatt MATH
3. N. Su, J. P. C. Watt, K. W. Vincent, M. E. Close, and R. Mao, “Analysis of turbulent flow patterns of soil water under field conditions using Burgers equation and porous suction-cupsamplers,” Australian Journal of Soil Research, vol. 42, no. 1, p. 916, 2004. View at: Google Scholar
4. N. J. Zabusky and M. D. Kruskal, “Interaction of "solitons" in a collisionless plasma and the recurrence of initial states,” Physical Review Letters, vol. 15, no. 6, pp. 240–243, 1965. View at: Publisher Site | Google Scholar
5. P. F. Zhao and M. Z. Qin, “Multisymplectic geometry and multisymplectic Preissmann scheme for the KdV equation,” Journal of Physics. A, vol. 33, no. 18, pp. 3613–3626, 2000.
6. P. C. Jain and D. N. Holla, “Numerical solutions of coupled Burger’s equation,” International Journal of Non-Linear Mechanics, vol. 13, pp. 213–222, 1978. View at: Google Scholar
7. R. S. Hirsh, “Higher order accurate difference solutions of fluid mechanics problems by a compact differencing technique,” Journal of Computational Physics, vol. 19, no. 1, pp. 90–109, 1975.
8. M. Ciment, S. H. Leventhal, and B. C. Weinberg, “The operator compact implicit method for parabolic equations,” Journal of Computational Physics, vol. 28, no. 2, pp. 135–166, 1978.
9. P. Arminjon and C. Beauchamp, “A finite element method for Burger’s equation in hydrodynamics,” International Journal for Numerical Methods in Engineering, vol. 12, pp. 415–428, 1978. View at: Google Scholar
10. E. L. Ortiz and K.-S. Pun, “A bidimensional tau-elements method for the numerical solution of nonlinear partial differential equations with an application to Burgers' equation,” Computers & Mathematics with Applications B, vol. 12, no. 5-6, pp. 1225–1240, 1986. View at: Google Scholar | Zentralblatt MATH
11. R. F. Sincorec and N. K. Madsen, “Software for nonlinear partial differential equations,” ACM Transactions on Mathematical Software, vol. 1, pp. 222–260, 1975. View at: Google Scholar
12. E. J. Kansa, “Multiquadrics—a scattered data approximation scheme with applications to computational fluid-dynamics. I. Surface approximations and partial derivative estimates,” Computers & Mathematics with Applications, vol. 19, no. 8-9, pp. 127–145, 1990.
13. E. J. Kansa, “Multiquadrics—a scattered data approximation scheme with applications to computational fluid-dynamics. II. Solutions to parabolic, hyperbolic and elliptic partial differential equations,” Computers & Mathematics with Applications, vol. 19, no. 8-9, pp. 147–161, 1990.
14. Y. C. Hon and X. Z. Mao, “An efficient numerical scheme for Burgers' equation,” Applied Mathematics and Computation, vol. 95, no. 1, pp. 37–50, 1998. View at: Publisher Site | Google Scholar | MathSciNet
15. Siraj-ul-Islam, A. J. Khattak, and I. A. Tirmizi, “A meshfree method for numerical solution of KdV equation,” Engineering Analysis with Boundary Elements, vol. 32, no. 10, pp. 849–855, 2008. View at: Publisher Site | Google Scholar
16. İ. Dağ and Y. Dereli, “Numerical solutions of KdV equation using radial basis functions,” Applied Mathematical Modelling, vol. 32, no. 4, pp. 535–546, 2008.
17. M. Dehghan and A. Shokri, “A numerical method for solution of the two-dimensional sine-Gordon equation using the radial basis functions,” Mathematics and Computers in Simulation, vol. 79, no. 3, pp. 700–715, 2008.
18. S. N. Atluri and T. Zhu, “A new meshless local Petrov-Galerkin (MLPG) approach in computational mechanics,” Computational Mechanics, vol. 22, no. 2, pp. 117–127, 1998.
19. T. Daĝ, A. Canivar, and A. Şahin, “Taylor-Galerkin and Taylor-collocation methods for the numerical solutions of Burgers' equation using B-splines,” Communications in Nonlinear Science and Numerical Simulation, vol. 16, no. 7, pp. 2696–2708, 2011. View at: Publisher Site | Google Scholar
20. M. J. D. Powell, “The theory of radial basis function approximation in 1990,” in Advances in numerical analysis, W. Light, Ed., vol. 2 of Oxford Sci. Publ., pp. 105–210, Oxford Univ. Press, New York, NY, USA, 1992. View at: Google Scholar
21. W. R. Madych and S. A. Nelson, “Multivariate interpolation and conditionally positive definite functions. II,” Mathematics of Computation, vol. 54, no. 189, pp. 211–230, 1990.
22. M. J. D. Powell, “Radial basis function approximations to polynomials,” in Numerical Analysis 1987, vol. 170 of Pitman Res. Notes Math. Ser., pp. 223–241, Longman Sci. Tech., Harlow, UK, 1988. View at: Google Scholar
23. M. D. Buhmann, “Radial basis functions,” in Acta Numerica, 2000, vol. 9 of Acta Numer., pp. 1–38, Cambridge Univ. Press, Cambridge, UK, 2000. View at: Google Scholar
24. C.-S. Huang, C.-F. Lee, and A. H.-D. Cheng, “Error estimate, optimal shape factor, and high precision computation of multiquadric collocation method,” Engineering Analysis with Boundary Elements, vol. 31, no. 7, pp. 614–623, 2007. View at: Publisher Site | Google Scholar
25. S. Geisser, “The predictive sample reuse method with applications,” Journal of the American Statistical Association, vol. 70, pp. 320–328, 1975. View at: Google Scholar
26. E. J. Kansa and Y. C. Hon, “Circumventing the ill-conditioning problem with multiquadric radial basis functions: applications to elliptic partial differential equations,” Computers & Mathematics with Applications, vol. 39, no. 7-8, pp. 123–137, 2000.
27. R. L. Hardy, “Multiquadric equations of topography and other irregular surfaces,” Journal of Geophysical Research, vol. 76, pp. 1905–1915, 1971. View at: Google Scholar
28. R. Franke, A Critical Comparison of Some Methods for Interpolation of Scattered Data, Ph.D. thesis, Naval Postgraduate School Monterey, California, 1979.
29. Z. M. Wu, “Compactly supported positive definite radial functions,” Advances in Computational Mathematics, vol. 4, no. 3, pp. 283–292, 1995.
30. H. Wendland, “Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree,” Advances in Computational Mathematics, vol. 4, no. 4, pp. 389–396, 1995.
31. E. Isaacson and H. B. Keller, Analysis of Numerical Methods, Dover Publications, New York, NY, USA, 1994.
32. F. J. Narcowich and J. D. Ward, “Norms of inverses and condition numbers for matrices associated with scattered data,” Journal of Approximation Theory, vol. 64, no. 1, pp. 69–94, 1991.
33. M. A. Abdou and A. A. Soliman, “Variational iteration method for solving Burger's and coupled Burger's equations,” Journal of Computational and Applied Mathematics, vol. 181, no. 2, pp. 245–251, 2005.
34. H. M. El-Hawary and E. O. Abdel-Rahman, “Numerical solution of the generalized Burger's equation via spectral/spline methods,” Applied Mathematics and Computation, vol. 170, no. 1, pp. 267–279, 2005. View at: Publisher Site | Google Scholar | MathSciNet

#### More related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.