On local convergence of a symmetric semi-discrete scheme for an abstract analogue of the Kirchhoff equation

The present work considers a nonlinear abstract hyperbolic equation with a self-adjoint positive definite operator, which represents a generalization of the Kirchhoff string equation. A symmetric three-layer semi-discrete scheme is constructed for an approximate solution of a Cauchy problem for this equation. Value of the gradient in the nonlinear term of the scheme is taken at the middle point. It makes possible to find an approximate solution at each time step by inverting the linear operator. Local convergence of the constructed scheme is proved. Numerical calculations for different model problems are carried out using this scheme.     

A Crank-Nicolson scheme for the Landau-Lifshitz equation without damping

An accurate and efficient numerical approach, based on a finite difference method with Crank-Nicolson time stepping, is proposed for the Landau-Lifshitz equation without damping. The phenomenological Landau-Lifshitz equation describes the dynamics of ferromagnetism. The Crank-Nicolson method is very popular in the numerical schemes for parabolic equations since it is second-order accurate in time. Although widely used, the method does not always produce accurate results when it is applied to the Landau-Lifshitz equation. The objective of this article is to enumerate the problems and then to propose an accurate and robust numerical solution algorithm. A discrete scheme and a numerical solution algorithm for the Landau-Lifshitz equation are described. A nonlinear multigrid method is used for handling the nonlinearities of the resulting discrete system of equations at each time step. We show numerically that the proposed scheme has a second-order convergence in space and time.     

Error analysis and applications of the Fourier-Galerkin Runge-Kutta schemes for high-order stiff PDEs

An integrating factor mixed with Runge-Kutta technique is a time integration method that can be efficiently combined with spatial spectral approximations to provide a very high resolution to the smooth solutions of some linear and nonlinear partial differential equations. In this paper, the novel hybrid Fourier-Galerkin Runge-Kutta scheme, with the aid of an integrating factor, is proposed to solve nonlinear high-order stiff PDEs. Error analysis and properties of the scheme are provided. Application to the approximate solution of the nonlinear stiff Korteweg-de Vries (the 3rd order PDE, dispersive equation), Kuramoto-Sivashinsky (the 4th order PDE, dissipative equation) and Kawahara (the 5th order PDE) equations are presented. Comparisons are made between this proposed scheme and the competing method given by Kassam and Trefethen. It is found that for KdV, KS and Kawahara equations, the proposed method is the best.     

A modified Newton–Lavrentiev regularization for nonlinear ill-posed Hammerstein-type operator equations

Recently, a new iterative method, called Newton–Lavrentiev regularization (NLR) method, was considered by George (2006) for regularizing a nonlinear ill-posed Hammerstein-type operator equation in Hilbert spaces. In this paper we introduce a modified form of the NLR method and derive order optimal error bounds by choosing the regularization parameter according to the adaptive scheme considered by Pereverzev and Schock (2005).     

A new high accuracy locally one-dimensional scheme for the wave equation

In this paper, a new locally one-dimensional (LOD) scheme with error of O(Δt⁴+h⁴) for the two-dimensional wave equation is presented. The new scheme is four layer in time and three layer in space. One main advantage of the new method is that only tridiagonal systems of linear algebraic equations have to be solved at each time step. The stability and dispersion analysis of the new scheme are given. The computations of the initial and boundary conditions for the two intermediate time layers are explicitly constructed, which makes the scheme suitable for performing practical simulation in wave propagation modeling. Furthermore, a comparison of our new scheme and the traditional finite difference scheme is given, which shows the superiority of our new method.     

An approximation of incompressible miscible displacement in porous media by mixed finite element method and characteristics-mixed finite element method

An approximation scheme is defined for incompressible miscible displacement in porous media. This scheme is constructed by using two methods. Standard mixed finite element is used for the Darcy velocity equation. A characteristics-mixed finite element method is presented for the concentration equation. Characteristic approximation is applied to handle the convection part of the concentration equation, and a lowest-order mixed finite element spatial approximation is adopted to deal with the diffusion part. Thus, the scalar unknown concentration and the diffusive flux can be approximated simultaneously. In order to derive the optimal L²$L^2$-norm error estimates, a post-processing step is included in the approximation to the scalar unknown concentration. This scheme conserves mass globally; in fact, on the discrete level, fluid is transported along the approximate characteristics. Numerical experiments are presented finally to validate the theoretical analysis.     

Fast and Robust Sixth Order Multigrid Computation for 3D Convection Diffusion Equation

We present a sixth-order explicit compact finite difference scheme to solve the three-dimensional (3D) convection-diffusion equation. We first use a multiscale multigrid method to solve the linear systems arising from a 19-point fourth-order discretization scheme to compute the fourth-order solutions on both a coarse grid and a fine grid. Then an operator-based interpolation scheme combined with an extrapolation technique is used to approximate the sixth-order accurate solution on the fine grid. Since the multigrid method using a standard point relaxation smoother may fail to achieve the optimal grid-independent convergence rate for solving convection-diffusion equations with a high Reynolds number, we implement the plane relaxation smoother in the multigrid solver to achieve better grid independency. Supporting numerical results are presented to demonstrate the efficiency and accuracy of the sixth-order compact (SOC) scheme, compared with the previously published fourth-order compact (FOC) scheme.     

Numerical simulation of blowup in nonlocal reaction–diffusion equations using a moving mesh method

In this paper we implement the moving mesh PDE method for simulating the blowup in reaction–diffusion equations with temporal and spacial nonlinear nonlocal terms. By a time-dependent transformation, the physical equation is written into a Lagrangian form with respect to the computational variables. The time-dependent transformation function satisfies a parabolic partial differential equation — usually called moving mesh PDE (MMPDE). The transformed physical equation and MMPDE are solved alternately by central finite difference method combined with a backward time-stepping scheme. The integration time steps are chosen to be adaptive to the blowup solution by employing a simple and efficient approach. The monitor function in MMPDEs plays a key role in the performance of the moving mesh PDE method. The dominance of equidistribution is utilized to select the monitor functions and a formal analysis is performed to check the principle. A variety of numerical examples show that the blowup profiles can be expressed correctly in the computational coordinates and the blowup rates are determined by the tests.     

A qualocation method for Burgers’ equation

In this paper, a qualocation method for the one-dimensional Burgers’ equation is proposed. A semidiscrete scheme along with optimal error estimates is discussed. Results of a numerical experiment performed support the theoretical results.     

An efficient nonlinear iteration scheme for nonlinear parabolic-hyperbolic system

A nonlinear iteration method named the Picard-Newton iteration is studied for a two-dimensional nonlinear coupled parabolic-hyperbolic system. It serves as an efficient method to solve a nonlinear discrete scheme with second spatial and temporal accuracy. The nonlinear iteration scheme is constructed with a linearization-discretization approach through discretizing the linearized systems of the original nonlinear partial differential equations. It can be viewed as an improved Picard iteration, and can accelerate convergence over the standard Picard iteration. Moreover, the discretization with second-order accuracy in both spatial and temporal variants is introduced to get the Picard-Newton iteration scheme. By using the energy estimate and inductive hypothesis reasoning, the difficulties arising from the nonlinearity and the coupling of different equation types are overcome. It follows that the rigorous theoretical analysis on the approximation of the solution of the Picard-Newton iteration scheme to the solution of the original continuous problem is obtained, which is different from the traditional error estimate that usually estimates the error between the solution of the nonlinear discrete scheme and the solution of the original problem. Moreover, such approximation is independent of the iteration number. Numerical experiments verify the theoretical result, and show that the Picard-Newton iteration scheme with second-order spatial and temporal accuracy is more accurate and efficient than that of first-order temporal accuracy.     

Numerical analysis for a conservative difference scheme to solve the Schrödinger-Boussinesq equation

In this paper, we present a finite difference scheme for the solution of an initial-boundary value problem of the Schrödinger-Boussinesq equation. The scheme is fully implicit and conserves two invariable quantities of the system. We investigate the existence of the solution for the scheme, give computational process for the numerical solution and prove convergence of iteration method by which a nonlinear algebra system for unknown Vⁿ⁺¹ is solved. On the basis of a priori estimates for a numerical solution, the uniqueness, convergence and stability for the difference solution is discussed. Numerical experiments verify the accuracy of our method.     

Backward differentiation type formulas for Volterra integral equations of the second kind

Summary Numerical integration formulas are discussed which are obtained by differentiation of the Volterra integral equation and by applying backward differentiation formulas to the resulting integro-differential equation. In particular, the stability of the method is investigated for a class of convolution kernels. The accuracy and stability behaviour of the method proposed in this paper is compared with that of (i) a block-implicit Runge-Kutta scheme, and (ii) the scheme obtained by applying directly a quadrature rule which is reducible to the backward differentiation formulas. The present method is particularly advantageous in the case of stiff Volterra integral equations.     

A robust and accurate finite difference method for a generalized Black-Scholes equation

In this paper we present a numerical method for a generalized Black-Scholes equation, which is used for option pricing. The method is based on a central difference spatial discretization on a piecewise uniform mesh and an implicit time stepping technique. Our scheme is stable for arbitrary volatility and arbitrary interest rate, and is second-order convergent with respect to the spatial variable. Furthermore, the present paper efficiently treats the singularities of the non-smooth payoff function. Numerical results support the theoretical results.     

Controllability method for acoustic scattering with spectral elements

We formulate the Helmholtz equation as an exact controllability problem for the time-dependent wave equation. The problem is then discretized in time domain with central finite difference scheme and in space domain with spectral elements. This approach leads to high accuracy in spatial discretization. Moreover, the spectral element method results in diagonal mass matrices, which makes the time integration of the wave equation highly efficient. After discretization, the exact controllability problem is reformulated as a least-squares problem, which is solved by the conjugate gradient method. We illustrate the method with some numerical experiments, which demonstrate the significant improvements in efficiency due to the higher order spectral elements. For a given accuracy, the controllability technique with spectral element method requires fewer computational operations than with conventional finite element method. In addition, by using higher order polynomial basis the influence of the pollution effect is reduced.     

A collocation method with cubic B-splines for solving the MRLW equation

The modified regularized long wave (MRLW) equation is solved numerically by collocation method using cubic B-splines finite element. A linear stability analysis of the scheme is shown to be marginally stable. Three invariants of motion are evaluated to determine the conservation properties of the algorithm, also the numerical scheme leads to accurate and efficient results. Moreover, interaction of two and three solitary waves are studied through computer simulation and the development of the Maxwellian initial condition into solitary waves is also shown.     

Convergence of a finite element scheme for the two-dimensional time-dependent Schrödinger equation in a long strip

This paper addresses the finite element method for the two-dimensional time-dependent Schrödinger equation on an infinite strip by using artificial boundary conditions. We first reduce the original problem into an initial-boundary value problem in a bounded domain by introducing a transparent boundary condition, then fully discretize this reduced problem by applying the Crank-Nicolson scheme in time and a bilinear or quadratic finite element approximation in space. This scheme, by a rigorous analysis, has been proved to be unconditionally stable and convergent, and its convergence order has also been obtained. Finally, two numerical examples are given to verify the accuracy of the scheme.     

High order compact Alternating Direction Implicit method for the generalized sine-Gordon equation

High order compact Alternating Direction Implicit scheme is given for solving the generalized sine-Gordon equation in a two-dimensional rectangular domain. We apply the compact finite difference operators to obtain a fourth order discretization for the second order space derivatives, and we give a linearized three time level algorithm for solving the original nonlinear equation. Error estimate is given by the energy method. Numerical results are provided to verify the accuracy and efficiency of this algorithm.     

Meshless local Petrov-Galerkin (MLPG) approximation to the two dimensional sine-Gordon equation

During the past few years, the idea of using meshless methods for numerical solution of partial differential equations (PDEs) has received much attention throughout the scientific community, and remarkable progress has been achieved on meshless methods. The meshless local Petrov-Galerkin (MLPG) method is one of the “truly meshless” methods since it does not require any background integration cells. The integrations are carried out locally over small sub-domains of regular shapes, such as circles or squares in two dimensions and spheres or cubes in three dimensions. In this paper the MLPG method for numerically solving the non-linear two-dimensional sine-Gordon (SG) equation is developed. A time-stepping method is employed to deal with the time derivative and a simple predictor-corrector scheme is performed to eliminate the non-linearity. A brief discussion is outlined for numerical integrations in the proposed algorithm. Some examples involving line and ring solitons are demonstrated and the conservation of energy in undamped SG equation is investigated. The final numerical results confirm the ability of proposed method to deal with the unsteady non-linear problems in large domains.     

A Petrov-Galerkin method for solving the generalized equal width (GEW) equation

The generalized equal width (GEW) equation is solved numerically by the Petrov-Galerkin method using a linear hat function as the test function and a quadratic B-spline function as the trial function. Product approximation has been used in this method. A linear stability analysis of the scheme shows it to be conditionally stable. Test problems including the single soliton and the interaction of solitons are used to validate the suggested method, which is found to be accurate and efficient. Finally, the Maxwellian initial condition pulse is studied.     

Relaxation approximation to bed-load sediment transport

In this work we propose and apply a numerical method based on finite volume relaxation approximation for computing the bed-load sediment transport in shallow water flows, in one and two space dimensions. The water flow is modeled by the well-known nonlinear shallow water equations which are coupled with a bed updating equation. Using a relaxation approximation, the nonlinear set of equations (and for two different formulations) is transformed to a semilinear diagonalizable problem with linear characteristic variables. A second order MUSCL-TVD method is used for the advection stage while an implicit–explicit Runge–Kutta scheme solves the relaxation stage. The main advantages of this approach are that neither Riemann problem solvers nor nonlinear iterations are required during the solution process. For the two different formulations, the applicability and effectiveness of the presented scheme is verified by comparing numerical results obtained for several benchmark test problems.