Solving the generalized Burgers–Huxley equation using the Adomian decomposition method

In this paper, a convergence proof of the Adomian decomposition method (ADM) applied to the generalized nonlinear Burgers–Huxley equation is presented. The decomposition scheme obtained from the ADM yields an analytical solution in the form of a rapidly convergent series. The direct symbolic–numeric scheme is shown to be efficient and accurate.     

Chebyshev Wavelet collocation method for solving generalized Burgers–Huxley equation

In this paper, new and efficient numerical method, called as Chebyshev wavelet collocation method, is proposed for the solutions of generalized Burgers–Huxley equation. This method is based on the approximation by the truncated Chebyshev wavelet series. By using the Chebyshev collocation points, algebraic equation system has been obtained and solved. Approximate solutions of the generalized Burgers–Huxley equation are compared with exact solutions. These calculations demonstrate that the accuracy of the Chebyshev wavelet collocation solutions is quite high even in the case of a small number of grid points. Copyright © 2015 John Wiley & Sons, Ltd.     

On a finite difference scheme for Burgers’ equation

In this paper we study properties of numerical solutions of Burger’s equation. Burgers’ equation is reduced to the heat equation on which we apply the Douglas finite difference scheme. The method is shown to be unconditionally stable, fourth order accurate in space and second order accurate in time. Two test problems are used to validate the algorithm. Numerical solutions for various values of viscosity are calculated and it is concluded that the proposed method performs well.     

High‐order finite difference schemes for numerical solutions of the generalized Burgers–Huxley equation

In this article, up to tenth‐order finite difference schemes are proposed to solve the generalized Burgers–Huxley equation. The schemes based on high‐order differences are presented using Taylor series expansion. To establish the numerical solutions of the corresponding equation, the high‐order schemes in space and a fourth‐order Runge‐Kutta scheme in time have been combined. Numerical experiments have been conducted to demonstrate the high‐order accuracy of the current algorithms with relatively minimal computational effort. The results showed that use of the present approaches in the simulation is very applicable for the solution of the generalized Burgers–Huxley equation. The current results are also seen to be more accurate than some results given in the literature. The proposed algorithms are seen to be very good alternatives to existing approaches for such physical applications. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1313‐1326, 2011     

On the new solutions of the generalized Burgers–Huxley equation

In this paper, we investigate a class of generalized Burgers–Huxley equation by employing the bifurcation method of planar dynamical systems. Firstly, we reduce the equation to a planar system via the traveling wave solution ansatz; then by computing the singular point quantities, we obtain the conditions of integrability and determine the existence of one stable limit cycle from Hopf bifurcation in the corresponding planar system. From this, some new exact solutions and a special periodic traveling wave solution, which is isolated as a limit, are obtained. Copyright © 2016 John Wiley & Sons, Ltd.     

Spectral collocation method and Darvishi’s preconditionings to solve the generalized Burgers–Huxley equation

In this paper, a numerical solution of the generalized Burgers–Huxley equation is presented. This is the application of spectral collocation method. To reduce roundoff error in this method we use Darvishi’s preconditionings. The numerical results obtained by this method have been compared with the exact solution. It can be seen that they are in a good agreement with each other, because errors are very small and figures of exact and numerical solutions are very similar.     

A numerical solution of Burgers’ equation by finite element method constructed on the method of discretization in time

In this paper, the Galerkin finite element method constructed on the method of discretization in time was applied to solve the one-dimensional nonlinear Burgers’ equation. The system of nonlinear equations obtained for each time step was solved by using the Newton method. In order to show the efficiency of the presented method, the numerical solutions obtained for various values of viscosity were compared with the exact solutions. It was seen that they were in excellent agreement.     

Long time error analysis of the fourth‐order compact finite difference methods for the nonlinear Klein–Gordon equation with weak nonlinearity

We present the fourth‐order compact finite difference (4cFD) discretizations for the long time dynamics of the nonlinear Klein–Gordon equation (NKGE), while the nonlinearity strength is characterized by ?^p with a constant p ∈ ?⁺ and a dimensionless parameter ? ∈ (0, 1] . Based on analytical results of the life‐span of the solution, rigorous error bounds of the 4cFD methods are carried out up to the time at O(?^?p) . We pay particular attention to how error bounds depend explicitly on the mesh size h and time step τ as well as the small parameter ? ∈ (0, 1] , which indicate that, in order to obtain ‘correct’ numerical solutions up to the time at O(?^?p) , the ? ‐scalability (or meshing strategy requirement) of the 4cFD methods should be taken as: h = O(?^p/4) and τ = O(?^p/2) . It has better spatial resolution capacity than the classical second order central difference methods. By a rescaling in time, it is equivalent to an oscillatory NKGE whose solution propagates waves with wavelength at O(1) in space and O(?^p) in time. It is straightforward to get the error bounds of the oscillatory NKGE in the fixed time. Finally, numerical results are provided to confirm our theoretical analysis.     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.     

Explicit analytical solutions of the generalized Burger and Burger–Fisher equations by homotopy perturbation method

In this article, we apply the homotopy perturbation method (HPM) to obtain approximate analytical solutions of the generalized Burger and Burger‐Fisher (B–F) equations. Several numerical examples are given to illustrate the efficiency of the HPM. Comparison of the result obtained by the present method with exact solution reveals that the accuracy and fast convergence of the new method. It is predicted that the HPM can be found wide application in engineering problems. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Fourth-order finite difference method for solving Burgers’ equation

In this paper, we present fourth-order finite difference method for solving nonlinear one-dimensional Burgers’ equation. This method is unconditionally stable. The convergence analysis of the present method is studied and an upper bound for the error is derived. Numerical comparisons are made with most of the existing numerical methods for solving this equation.     

A three‐level linearized compact difference scheme for the Ginzburg–Landau equation

A high‐order finite difference method for the two‐dimensional complex Ginzburg–Landau equation is considered. It is proved that the proposed difference scheme is uniquely solvable and unconditionally convergent. The convergent order in maximum norm is two in temporal direction and four in spatial direction. In addition, an efficient alternating direction implicit scheme is proposed. Some numerical examples are given to confirm the theoretical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 876–899, 2015     

Conservative compact finite difference scheme for the coupled Schrödinger–Boussinesq equation

In this article, two conserved compact finite difference schemes for solving the nonlinear coupled Schrödinger–Boussinesq equation are proposed. The conservative property, existence, convergence, and stability of the difference solutions are theoretically analyzed. The numerical results are reported to demonstrate the accuracy and efficiency of the methods and to confirm our theoretical analysis. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1667–1688, 2016     

A high‐order compact scheme for the nonlinear fractional Klein–Gordon equation

In this article, a high‐order finite difference scheme for a kind of nonlinear fractional Klein–Gordon equation is derived. The time fractional derivative is described in the Caputo sense. The solvability of the difference system is discussed by the Leray–Schauder fixed point theorem, while the stability and L_∞ convergence of the finite difference scheme are proved by the energy method. Numerical examples are provided to demonstrate the theoretical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 706–722, 2015     

A fast‐high order compact difference method for the fractional cable equation

The Cable equation is one of the most fundamental equations for modeling neuronal dynamics. In this article, we consider a high order compact finite difference numerical solution for the fractional Cable equation, which is a generalization of the classical Cable equation by taking into account the anomalous diffusion in the movement of the ions in neuronal system. The resulting finite difference scheme is unconditionally stable and converges with the convergence order of in maximum norm, 1‐norm and 2‐norm. Furthermore, we present a fast solution technique to accelerate Toeplitz matrix‐vector multiplications arising from finite difference discretization. This fast solution technique is based on a fast Fourier transform and depends on the special structure of coefficient matrices, and it helps to reduce the computational work from required by traditional methods to without using any lossy compression, where and τ is the size of time step, and h is the size of space step. Moreover, we give a compact finite difference scheme and consider its stability analysis for two‐dimensional fractional Cable equation. The applicability and accuracy of the scheme are demonstrated by numerical experiments to support our theoretical analysis.     

A meshless approach for solution of Burgers’ equation

A new meshless method called gradient reproducing kernel particle method (GRKPM) is proposed for numerical solutions of one-dimensional Burgers’ equation with various values of viscosity and different initial and boundary conditions. Discretization is first done in the space via GRKPM, and subsequently, the reduced system of nonlinear ordinary differential equations is discretized in time by the Gear's method. Comparison with the exact solutions, which are only available for restricted initial conditions and values of viscosity, approves the efficacy of the proposed method. For challenging cases involving small viscosities, comparison with the results obtained using other numerical schemes in the literature further attests the desirable features of the presented methodology.     

A three‐level linearized finite difference scheme for the camassa–holm equation

The Camassa–Holm (CH) system is a strong nonlinear third‐order evolution equation. So far, the numerical methods for solving this problem are only a few. This article deals with the finite difference solution to the CH equation. A three‐level linearized finite difference scheme is derived. The scheme is proved to be conservative, uniquely solvable, and conditionally second‐order convergent in both time and space in the discrete L_∞ norm. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 451–471, 2014     

A conservative compact difference scheme for the coupled Klein–Gordon–Schrödinger equation

In this article, a conservative compact difference scheme is presented for the periodic initial‐value problem of Klein–Gordon–Schrödinger equation. On the basis of some inequalities about norms and the priori estimates, convergence of the difference solution is proved with order O(h⁴ +τ ²) in maximum norm. Numerical experiments demonstrate the accuracy and efficiency of the compact scheme. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

A monotone scheme for Hamilton–Jacobi equations via the nonstandard finite difference method

A usual way of approximating Hamilton–Jacobi equations is to couple space finite element discretization with time finite difference discretization. This classical approach leads to a severe restriction on the time step size for the scheme to be monotone. In this paper, we couple the finite element method with the nonstandard finite difference method, which is based on Mickens' rule of nonlocal approximation. The scheme obtained in this way is unconditionally monotone. The convergence of the new method is discussed and numerical results that support the theory are provided. Copyright © 2009 John Wiley & Sons, Ltd.     

On the convergence of difference schemes for generalized Benjamin–Bona–Mahony equation

We consider an initial boundary‐value problem for the generalized Benjamin–Bona–Mahony equation. A three‐level conservative difference schemes are studied. The obtained algebraic equations are linear with respect to the values of unknown function for each new level. It is proved that the scheme is convergent with the convergence rate of order k – 1, when the exact solution belongs to the Sobolev space of order . © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 301–320, 2014