A compact finite difference method for the solution of the generalized Burgers–Fisher equation

In this article, numerical solutions of the generalized Burgers–Fisher equation are obtained using a compact finite difference method with minimal computational effort. To verify this, a combination of a sixth‐order compact finite difference scheme in space and a low‐storage third‐order total variation diminishing Runge–Kutta scheme in time have been used. The computed results with the use of this technique have been compared with the exact solution to show the accuracy of it. The approximate solutions to the equation have been computed without transforming the equation and without using linearization. Comparisons indicate that there is a very good agreement between the numerical solutions and the exact solutions in terms of accuracy. The present method is seen to be a very good alternative to some existing techniques for realistic problems. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

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.     

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.     

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.     

High‐order compact difference schemes for the modified anomalous subdiffusion equation

In this article, two kinds of high‐order compact finite difference schemes for second‐order derivative are developed. Then a second‐order numerical scheme for a Riemann–Liouvile derivative is established based on a fractional centered difference operator. We apply these methods to a fractional anomalous subdiffusion equation to construct two kinds of novel numerical schemes. The solvability, stability, and convergence analysis of these difference schemes are studied by using Fourier method. The convergence orders of these numerical schemes are and , respectively. Finally, numerical experiments are displayed which are in line with the theoretical analysis. © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 213–242, 2016     

Compact finite difference schemes of sixth order for the Helmholtz equation

New compact finite difference schemes of sixth order are derived for the three dimensional Helmholtz equation, Δu-κ²u=-f$\mathrm{\Delta }u-{\kappa }^{2}u=-f$. Convergence characteristics and accuracy are compared and a truncation error analysis is presented for a broad range of κ$\kappa$-values.     

A finite difference scheme for traveling wave solutions to Burgers equation

We construct a finite difference scheme for the ordinary differential equation describing the traveling wave solutions to the Burgers equation. This difference equation has the property that its solution can be calculated. Our procedure for determining this solution follows closely the analysis used to obtain the traveling wave solutions to the original ordinary differential equation. The finite difference scheme follows directly from application of the nonstandard rules proposed by Mickens. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14: 815–820, 1998     

High‐order Padé and singly diagonally Runge‐Kutta schemes for linear ODEs,application to wave propagation problems

In this article, we address the problem of constructing high‐order implicit time schemes for wave equations. We consider two classes of one‐step A‐stable schemes adapted to linear Ordinary Differential Equation (ODE). The first class, which is not dissipative is based on the diagonal Padé approximant of exponential function. For this class, the obtained schemes have the same stability function as Gauss Runge‐Kutta (Gauss RK) schemes. They have the advantage to involve the solution of smaller linear systems at each time step compared to Gauss RK. The second class of schemes are constructed such that they require the inversion of a unique linear system several times at each time step like the Singly Diagonally Runge‐Kutta (SDIRK) schemes. While the first class of schemes is constructed for an arbitrary order of accuracy, the second‐class schemes is given up to order 12. The performance assessment we provide shows a very good level of accuracy for both classes of schemes, and the great interest of considering high‐order time schemes that are faster. The diagonal Padé schemes seem to be more accurate and more robust.     

High‐order asymptotic‐preserving schemes for linear systems: Application to the Goldstein–Taylor equations

In this work, we address the numerical approximation of linear systems with possibly stiff source terms which induce an asymptotic diffusion limit. More precisely, we are interested in the design of high‐order asymptotic‐preserving schemes. Our approach is based on a very simple modification of the numerical flux associated with the usual HLL scheme. This alteration can be understood as a numerical diffusion reduction technique and allows to capture the correct asymptotic behavior in the diffusion limit and to consider uniformly high‐order extensions. We more specifically consider the case of the Goldstein–Taylor model but the overall approach is shown to be easily adapted to more general systems.     

High‐order implicit staggered‐grid finite differences methods for the acoustic wave equation

Motivated by the idea that staggered‐grid methods give a greater stability and give energy conservation, this article presents a new family of high‐order implicit staggered‐grid finite difference methods with any order of accuracy to approximate partial differential equations involving second‐order derivatives. In particular, we numerically analyze our new methods for the solution of the one‐dimensional acoustic wave equation. The implicit formulation is based on the plane wave theory and the Taylor series expansion and only involves the solution of tridiagonal matrix equations resulting in an attractive method with higher order of accuracy but nearly the same computation cost as those of explicit formulation. The order of accuracy of the proposal staggered formulas are similar to the methods with conventional grids for a ‐point operator: the explicit formula is th‐order and the implicit formula is th‐order; however, the results demonstrate that new staggered methods are superior in terms of stability properties to the classical methods in the context of solving wave equations.     

Parameterized families of finite difference schemes for the wave equation

This article is devoted to an analysis of simple families of finite difference schemes for the wave equation. These families are dependent on several free parameters, and methods for obtaining stability bounds as a function of these parameters are discussed in detail. Access to explicit stability bounds such as those derived here may, it is hoped, lead to optimization techniques for so‐called spectral‐like methods, which are difference schemes dependent on many free parameters (and for which maximizing the order of accuracy may not be the defining criterion). Though the focus is on schemes for the wave equation in one dimension, the analysis techniques are extended to two dimensions; implicit schemes such as ADI methods are examined in detail. Numerical results are presented. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 463–480, 2004.     

Solvability of a nonlinear fifth‐order difference equation

Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal.     

B‐spline collocation algorithm for numerical solution of the generalized Burger's‐Huxley equation

The cubic B‐spline collocation scheme is implemented to find numerical solution of the generalized Burger's–Huxley equation. The scheme is based on the finite‐difference formulation for time integration and cubic B‐spline functions for space integration. Convergence of the scheme is discussed through standard convergence analysis. The proposed scheme is of second‐order convergent. The accuracy of the proposed method is demonstrated by four test problems. The numerical results are found to be in good agreement with the exact solutions. Results are compared with other results given in literature. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Adequacy of finite difference schemes for convection‐diffusion equations

Finite difference schemes for the numerical solution of singularly perturbed convection problems on uniform grids are studied in the limit case where the viscosity and the meshsize approach zero at the same time. The present error estimates are given in terms of order of magnitude in the above limit process and are useful in a priori choosing adequate schemes and meshsizes for boundary‐layer problems and problems with closed characteristics. Published 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 280–295, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/num.10007     

Analysis of some finite difference schemes for two‐dimensional Ginzburg‐Landau equation

We study the rate of convergence of some finite difference schemes to solve the two‐dimensional Ginzburg‐Landau equation. Avoiding the difficulty in estimating the numerical solutions in uniform norm, we prove that all the schemes are of the second‐order convergence in L₂ norm by an induction argument. The unique solvability, stability, and an iterative algorithm are also discussed. A numerical example shows the correction of the theoretical analysis.© 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1340‐1363, 2011     

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.     

Geometric finite difference schemes for the generalized hyperelastic-rod wave equation

Geometric integrators are presented for a class of nonlinear dispersive equations which includes the Camassa-Holm equation, the BBM equation and the hyperelastic-rod wave equation. One group of schemes is designed to preserve a global property of the equations: the conservation of energy; while the other one preserves a more local feature of the equations: the multi-symplecticity.     

Singly diagonally implicit runge‐kutta method for time‐dependent reaction‐diffusion equation

In this article, an efficient fourth‐order accurate numerical method based on Padé approximation in space and singly diagonally implicit Runge‐Kutta method in time is proposed to solve the time‐dependent one‐dimensional reaction‐diffusion equation. In this scheme, we first approximate the spatial derivative using the second‐order central finite difference then improve it to fourth‐order by applying Padé approximation. A three stage fourth‐order singly diagonally implicit Runge‐Kutta method is then used to solve the resulting system of ordinary differential equations. It is also shown that the scheme is unconditionally stable, and is suitable for stiff problems. Several numerical examples are solved by the scheme and the efficiency and accuracy of the new scheme are compared with two widely used high‐order compact finite difference methods. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 27: 1423–1441, 2011     

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.