A linearly semi-implicit compact scheme for the Burgers–Huxley equation

In this paper, a linearly semi-implicit compact scheme is developed for the Burgers–Huxley equation. The equation is decomposed into two subproblems, i.e. a Burgers equation and a nonlinear ODE, by the operator splitting technique. The Burgers equation is solved by a linearly self-starting compact scheme which is fourth-order accurate in space and second-order accurate in time. The nonlinear ODE is discretized by a third-order semi-implicit Runge–Kutta method, which possesses good numerical stability with low computational cost. The numerical experiments show that the scheme provides the expected convergence order. Finally, several experiments are conducted to simulate the solutions of the Burgers–Huxley equation to validate our numerical method.     

Scalable discrete adjoint for the transient Savage–Hutter equation on the primal consistent adaptive grid

Engineering with Computers - Computing the adjoint for a transient non-linear hyperbolic PDE, like the Savage–Hutter equation for modeling dry granular mass flows, is a challenge with often...     

The numerical integration scheme for a fast Petrov–Galerkin method for solving the generalized airfoil equation

The main purpose of this paper is to give the numerical integration scheme for a fast Petrov–Galerkin method for solving the generalized airfoil equation, considered in a recent paper (Cai, J. Complex. 25:420–436, 2009). This scheme leads to a fully discrete sparse linear system. We show that it requires a nearly linear computational cost to get this system, and the approximate solution of the resulting linear system preserves the optimal convergent order. Numerical experiments are presented to confirm the theoretical estimates.     

Chebyshev polynomials for the numerical solution of fractal–fractional model of nonlinear Ginzburg–Landau equation

Engineering with Computers - This paper introduces a new version for the nonlinear Ginzburg–Landau equation derived from fractal–fractional derivatives and proposes a computational...     

The numerical solution of a generalized Burgers–Huxley equation through a conditionally bounded and symmetry-preserving method

In this article, we propose a non-standard, finite-difference scheme to approximate the solutions of a generalized Burgers–Huxley equation from fluid dynamics. Our numerical method preserves the skew-symmetry of the partial differential equation under study and, under some analytical constraints of the model constants and the computational parameters involved, it is capable of preserving the boundedness and the positivity of the solutions. In the linear regime, the scheme is consistent to first order in time (due partially to the inclusion of a tuning parameter in the approximation of a temporal derivative), and to second order in space. We compare the results of our computational technique against the exact solutions of some particular initial-boundary-value problems. Our simulations indicate that the method presented in this work approximates well the theoretical solutions and, moreover, that the method preserves the boundedness of solutions within the analytical constraints derived here. In the problem of approximating solitary-wave solutions of the model under consideration, we present numerical evidence on the existence of an optimum value of the tuning parameter of our technique, for which a minimum relative error is achieved. Finally, we linearly perturb a steady-state solution of the partial differential equation under investigation, and show that our simulations still converge to the same constant solution, establishing thus robustness of our method in this sense.     

Dissipative exponentially-fitted methods for the numerical solution of the Schrödinger equation

The first dissipative exponentially fitted method for the numerical integration of the Schr?dinger equation is developed in this paper. The technique presented is a nonsymmetric multistep (dissipative) method. An application to the bound-states problem and the resonance problem of the radial Schr?dinger equation indicates that the new method is more efficient than the classical dissipative method and other well-known methods. Based on the new method and the method of Raptis and Allison (Comput. Phys. Commun. 14 (1978) 1-5) a new variable-step method is obtained. The application of the new variable-step method to the coupled differential equations arising from the Schr?dinger equation indicates the power of the new approach.     

Third-order temporal discrete scheme for the non-stationary Navier–Stokes equations

In this article, we suggest a new third-order time discrete scheme for the two-dimensional non-stationary Navier–Stokes equations. After presenting the Galerkin finite element approximation for the spatial discretization, we consider an implicit/explicit time discrete scheme for the problem, which is based on the two-step Adams–Moulton scheme (implicit scheme) for the linear term and the three-step Adams–Bashforth scheme (explicit scheme) for the nonlinear term. In this method, we only need to solve a linearized discrete system at each time step, so the scheme can converge fast and the computational cost can be reduced. Moreover, under some assumptions, we deduce the stability and optimal error estimate for the velocity in L ²-norm.     

Intelligent computing for numerical treatment of nonlinear prey–predator models

In this study, a new computing paradigm is presented for evaluation of dynamics of nonlinear prey–predator mathematical model by exploiting the strengths of integrated intelligent mechanism through artificial neural networks, genetic algorithms and interior-point algorithm. In the scheme, artificial neural network based differential equation models of the system are constructed and optimization of the networks is performed with effective global search ability of genetic algorithm and its hybridization with interior-point algorithm for rapid local search. The proposed technique is applied to variants of nonlinear prey–predator models by taking different rating factors and comparison with Adams numerical solver certify the correctness for each scenario. The statistical studies have been conducted to authenticate the accuracy and convergence of the design methodology in terms of mean absolute error, root mean squared error and Nash-Sutcliffe efficiency performance indices.     

An analytic solution for the space–time fractional advection–dispersion equation using the optimal homotopy asymptotic method

We present an analytic algorithm to solve the space–time fractional advection–dispersion equation (FADE) based on the optimal homotopy asymptotic method (OHAM), which has the advantage of controlling the region and rate of convergence of the solution series via several auxiliary parameters over the traditional homotopy analysis method (HAM) having only one auxiliary parameter. Furthermore, our proposed algorithm gives better results compared to the Adomian decomposition method (ADM) and the homotopy perturbation method (HPM) in the sense that fewer iterations are required to get a sufficiently accurate solution and the solution has a greater radius of convergence. We find that the iterations obtained by the proposed method converge to the numerical/exact solution of the ADE as the fractional orders $\alpha ,\beta ,\gamma$ tend to their integral values. Numerical examples are given to illustrate the proposed algorithm. The figures and tables show the superiority of the OHAM over the HAM.     

A conservative numerical method for the Cahn–Hilliard equation with Dirichlet boundary conditions in complex domains

In this paper we present a conservative numerical method for the Cahn–Hilliard equation with Dirichlet boundary conditions in complex domains. The method uses an unconditionally gradient stable nonlinear splitting numerical scheme to remove the high-order time-step stability constraints. The continuous problem has the conservation of mass and we prove the conservative property of the proposed discrete scheme in complex domains. We describe the implementation of the proposed numerical scheme in detail. The resulting system of discrete equations is solved by a nonlinear multigrid method. We demonstrate the accuracy and robustness of the proposed Dirichlet boundary formulation using various numerical experiments. We numerically show the total energy decrease and the unconditionally gradient stability. In particular, the numerical results indicate the potential usefulness of the proposed method for accurately calculating biological membrane dynamics in confined domains.     

An expert system for the numerical solution of the radial Schrödinger equation

An expert system for the numerical solution of the phase shift problem of the radial Schrödinger equation is developed in this paper.     

A novel time-marching scheme using numerical Green’s functions: A comparative study for the scalar wave equation

The present paper presents the formulation of a novel time-marching method based on the Explicit Green’s Approach (ExGA) to solve scalar wave propagation problems. By means of the weighted residual method in both time and space, the time integral expression concerning the ExGA is readily established. The arising ExGA time integral expression is spatially discretized in a finite element sense and a recursive scheme that employs time-domain numerical Green’s function matrices is adopted to evaluate the displacement and the velocity vectors. These Green’s matrices are computed by the time discontinuous Galerkin finite element method only at the first time step. The system of coupled equations originated from the time discontinuous Galerkin method is then solved by an iterative predictor–multicorrector algorithm. Once the Green’s matrices are computed, no iterative process is required to obtain the displacement and the velocity vectors at any time level. At the end of the paper, numerical examples are presented in order to compare the proposed approach with other approaches.     

A variable step method for the numerical integration of the one-dimensional Schrödinger equation

Most numerical methods which have been proposed for the approximate integration of the one-dimensional Schrödinger equation use a fixed step length of integration. Such an approach can of course result in gross inefficiency since the small step length which must normally be used in the initial part of the range of integration to obtain the desired accuracy must then be used throughout the integration. In this paper we consider the method of embedding, which is widely used with explicit Runge-Kutta methods for the solution of first order initial value problems, for use with the special formulae used to integrate the Schrödinger equation. By adopting this technique we have available at each step an estimate of the local truncation error and this estimate can be used to automatically control the step length of integration. Also considered is the problem of estimating the global truncation error at the end of the range of integration. The power of the approaches considered is illustrated by means of some numerical examples.     

High order Bessel fitting methods for the numerical integration of the Schrödinger equation

In this paper we show how to construct explicit multistep algorithms for an accurate and efficient numerical integration of the radial Schr?dinger equation. The proposed methods are Bessel fitting, that is to say, they integrate exactly any linear combination of Bessel and Newman functions and ordinary polynomials. They are the first of the like methods that can achieve any order.     

A family of fourth-order difference schemes on rotated grid for two-dimensional convection–diffusion equation

We derive a family of fourth-order finite difference schemes on the rotated grid for the two-dimensional convection–diffusion equation with variable coefficients. In the case of constant convection coefficients, we present an analytic bound on the spectral radius of the line Jacobi’s iteration matrix in terms of the cell Reynolds numbers. Our analysis and numerical experiments show that the proposed schemes are stable and produce highly accurate solutions. Classical iterative methods with these schemes are convergent with large values of the convection coefficients. We also compare the fourth-order schemes with the nine point scheme obtained from the second-order central difference scheme after one step of cyclic reduction.     

An eighth order exponentially-fitted method for the numerical integration of the Schrödinger equation

An eighth order exponentially-fitted method is developed for the numerical solution of the Schrödinger equation. The formula considered contains certain free parameters which allow it to be fitted automatically to exponential functions. An error analysis is also given. Numerical and theoretical results indicate that the new method is much more accurate than other classical and exponentially fitted methods.     

Unique continuation property for the Zakharov–Kuznetsov equation

In this paper, we consider the unique continuation property for the Zakharov–Kuznetsov equation posed in a bounded domain. For this purpose, we establish a boundary Carleman estimate for the linear Zakharov–Kuznetsov operator.     

First vorticity–velocity–pressure numerical scheme for the Stokes problem

We consider the bidimensional Stokes problem for incompressible fluids and recall the vorticity, velocity and pressure variational formulation, which was previously proposed by one of the authors, and allows very general boundary conditions. We develop a natural implementation of this numerical method and we describe in this paper the numerical results we obtain. Moreover, we prove that the low degree numerical scheme we use is stable for Dirichlet boundary conditions on the vorticity. Numerical results are in accordance with the theoretical ones. In the general case of unstructured meshes, a stability problem is present for Dirichlet boundary conditions on the velocity, exactly as in the stream function-vorticity formulation. Finally, we show on some examples that we observe numerical convergence for regular meshes or embedded ones for Dirichlet boundary conditions on the velocity.     

A numerical algorithm based on a variational iterative approximation for the discrete Hamilton–Jacobi–Bellman (HJB) equation

This paper presents a numerical algorithm based on a variational iterative approximation for the Hamilton–Jacobi–Bellman equation, and a domain decomposition technique based on this algorithm is also studied. The convergence theorems have been established. Numerical results indicate the efficiency and accuracy of the methods.