Error and extrapolation of a compact LOD method for parabolic differential equations

This paper is concerned with a compact locally one-dimensional (LOD) finite difference method for solving two-dimensional nonhomogeneous parabolic differential equations. An explicit error estimate for the finite difference solution is given in the discrete infinity norm. It is shown that the method has the accuracy of the second-order in time and the fourth-order in space with respect to the discrete infinity norm. A Richardson extrapolation algorithm is developed to make the final computed solution fourth-order accurate in both time and space when the time step equals the spatial mesh size. Numerical results demonstrate the accuracy and the high efficiency of the extrapolation algorithm.     

Maximum norm error bound of a linearized difference scheme for a coupled nonlinear Schrödinger equations

In this article, a linearized conservative difference scheme for a coupled nonlinear Schrödinger equations is studied. The discrete energy method and an useful technique are used to analyze the difference scheme. It is shown that the difference solution unconditionally converges to the exact solution with second order in the maximum norm. Numerical experiments are presented to support the theoretical results.     

A uniformly convergent scheme for a system of reaction–diffusion equations

In this work a system of two parabolic singularly perturbed equations of reaction–diffusion type is considered. The asymptotic behaviour of the solution and its partial derivatives is given. A decomposition of the solution in its regular and singular parts has been used for the asymptotic analysis of the spatial derivatives. To approximate the solution we consider the implicit Euler method for time stepping and the central difference scheme for spatial discretization on a special piecewise uniform Shishkin mesh. We prove that this scheme is uniformly convergent, with respect to the diffusion parameters, having first-order convergence in time and almost second-order convergence in space, in the discrete maximum norm. Numerical experiments illustrate the order of convergence proved theoretically.     

Second-order characteristic schemes in time and age for a nonlinear age-structured population model

In this paper, we analyze two new second-order characteristic schemes in time and age for an age-structured population model with nonlinear diffusion and reaction. By using the characteristic difference to approximate the transport term and the average along the characteristics to treat the nonlinear spatial diffusion and reaction terms, an implicit second-order characteristic scheme is proposed. To compute the nonlinear approximation system, an explicit second-order characteristic scheme in time and age is further proposed by using the extrapolation technique. The global existence and uniqueness of the solution of the nonlinear approximation scheme are established by using the theory of variation methods, Schauder’s fixed point theorem, and the technique of prior estimates. The optimal error estimates of second order in time and age are strictly proved for both the implicit and the explicit characteristic schemes. Numerical examples are given to illustrate the performance of the methods.     

A second-order difference scheme for a parameterized singular perturbation problem

In this paper we consider a singularly perturbed quasilinear boundary value problem depending on a parameter. The problem is discretized using a hybrid difference scheme on Shishkin-type meshes. We show that the scheme is second-order convergent, in the discrete maximum norm, independent of singular perturbation parameter. Numerical experiments support these 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.     

A fourth-order numerical method for the planetary geostrophic equations with inviscid geostrophic balance

The planetary geostrophic equations with inviscid balance equation are reformulated in an alternate form, and a fourth-order finite difference numerical method of solution is proposed and analyzed in this article. In the reformulation, there is only one prognostic equation for the temperature field and the velocity field is statically determined by the planetary geostrophic balance combined with the incompressibility condition. The key observation is that all the velocity profiles can be explicitly determined by the temperature gradient, by utilizing the special form of the Coriolis parameter. This brings convenience and efficiency in the numerical study. In the fourth-order scheme, the temperature is dynamically updated at the regular numerical grid by long-stencil approximation, along with a one-sided extrapolation near the boundary. The velocity variables are recovered by special solvers on the 3-D staggered grid. Furthermore, it is shown that the numerical velocity field is divergence-free at the discrete level in a suitable sense. Fourth order convergence is proven under mild regularity requirements. R. Samelson was supported by NSF grant OCE04-24516 and Navy ONR grant N00014-05-1-0891. R. Temam was supported by NSF grant DMS-0604235 and the research fund of Indiana University. S. Wang was supported by NSF grant DMS-0605067 and Navy ONR grant N00014-05-1-0218.     

Maximum norm error bounds of ADI and compact ADI methods for solving parabolic equations

Alternating direction implicit (ADI) schemes are computationally efficient and widely utilized for numerical approximation of the multidimensional parabolic equations. By using the discrete energy method, it is shown that the ADI solution is unconditionally convergent with the convergence order of two in the maximum norm. Considering an asymptotic expansion of the difference solution, we obtain a fourth‐order, in both time and space, approximation by one Richardson extrapolation. Extension of our technique to the higher‐order compact ADI schemes also yields the maximum norm error estimate of the discrete solution. And by one extrapolation, we obtain a sixth order accurate approximation when the time step is proportional to the squares of the spatial size. An numerical example is presented to support our theoretical results. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

Stability and accuracy of time-extrapolated ADI-FDTD methods for solving wave equations

Some recent work on the ADI-FDTD method for solving Maxwell's equations in 3-D have brought out the importance of extrapolation methods for the time stepping of wave equations. Such extrapolation methods have previously been used for the solution of ODEs. The present context (of wave equations) brings up two main questions which have not been addressed previously: (1) when will extrapolation in time of an unconditionally stable scheme for a wave equation again feature unconditional stability, and (2) how will the accuracy and computational efficiency depend on how frequently in time the extrapolations are carried out. We analyze these issues here.     

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.     

On the penalty-projection method for the Navier–Stokes equations with the MAC mesh

We deal with the time-dependent Navier–Stokes equations (NSE) with Dirichlet boundary conditions on the whole domain or, on a part of the domain and open boundary conditions on the other part. It is shown numerically that combining the penalty-projection method with spatial discretization by the Marker And Cell scheme (MAC) yields reasonably good results for solving the above-mentioned problem. The scheme which has been introduced combines the backward difference formula of second-order (BDF2, namely Gear’s scheme) for the temporal approximation, the second-order Richardson extrapolation for the nonlinear term, and the penalty-projection to split the velocity and pressure unknowns. Similarly to the results obtained for other projection methods, we estimate the errors for the velocity and pressure in adequate norms via the energy method.     

Locally linearized fractional step methods for nonlinear parabolic problems

This work deals with the efficient numerical solution of a class of nonlinear time-dependent reaction-diffusion equations. Via the method of lines approach, we first perform the spatial discretization of the original problem by applying a mimetic finite difference scheme. The system of ordinary differential equations arising from that process is then integrated in time with a linearly implicit fractional step method. For that purpose, we locally decompose the discrete nonlinear diffusion operator using suitable Taylor expansions and a domain decomposition splitting technique. The totally discrete scheme considers implicit time integrations for the linear terms while explicitly handling the nonlinear ones. As a result, the original problem is reduced to the solution of several linear systems per time step which can be trivially decomposed into a set of uncoupled parallelizable linear subsystems. The convergence of the proposed methods is illustrated by numerical experiments.     

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.     

Fourth-order compact schemes with adaptive time step for monodomain reaction–diffusion equations

Multigrid applied to fourth-order compact schemes for monodomain reaction–diffusion equations in two dimensions has been developed. The scheme accounts for the anisotropy of the medium, allows for any cellular activation model to be used, and incorporates an adaptive time step algorithm. Numerical simulations show up to a 40% reduction in computational time for complex cellular models as compared to second-order schemes for the same solution error. These results point to high-order schemes as valid alternatives for the efficient solution of the cardiac electrophysiology problem when complex cellular activation models are used.     

An almost fourth order uniformly convergent difference scheme for a semilinear singularly perturbed reaction-diffusion problem

Summary. This paper is concerned with a high order convergent discretization for the semilinear reaction-diffusion problem: , for , subject to , where . We assume that on , which guarantees uniqueness of a solution to the problem. Asymptotic properties of this solution are discussed. We consider a polynomial-based three-point difference scheme on a simple piecewise equidistant mesh of Shishkin type. Existence and local uniqueness of a solution to the scheme are analysed. We prove that the scheme is almost fourth order accurate in the discrete maximum norm, uniformly in the perturbation parameter . We present numerical results in support of this result. Received February 25, 1994     

广义sine-Gordon方程高精度隐式紧致差分方法

本文研究一类二维非线性的广义sine-Gordon(简称SG)方程的有限差分格式.首先构造三层时间的紧致交替方向隐式差分格式,并用能量分析法证明格式具有二阶时间精度和四阶空间精度.然后应用改进的Richardson外推算法将时间精度提高到四阶.最后,数值算例证实改进后的算法在空间和时间上均达到四阶精度.     

Sixth-Order Compact Extended Trapezoidal Rules for 2D Schrödinger Equation

Based on high-order linear multistep methods (LMMs), we use the class of extended trapezoidal rules (ETRs) to solve boundary value problems of ordinary differential equations (ODEs), whose numerical solutions can be approximated by boundary value methods (BVMs). Then we combine this technique with fourth-order Padé compact approximation to discrete 2D Schrödinger equation. We propose a scheme with sixth-order accuracy in time and fourth-order accuracy in space. It is unconditionally stable due to the favourable property of BVMs and ETRs. Furthermore, with Richardson extrapolation, we can increase the scheme to order 6 accuracy both in time and space. Numerical results are presented to illustrate the accuracy of our scheme.     

On the Galerkin finite element approximations to multi-dimensional differential and integro-differential parabolic equations

The maximum norm error estimates of the Galerkin finite element approximations to the solutions of differential and integro-differential multi-dimensional parabolic problems are considered. Our method is based on the use of the discrete version of the elliptic-Sobolev inequality and some operator representations of the finite element solutions. The results of the present paper lead to the error estimates of optimal or almost optimal order for the case of simplicial Lagrangian piecewise polynomial elements.     

Fitted finite difference method for singularly perturbed delay differential equations

This paper deals with singularly perturbed initial value problem for linear second-order delay differential equation. An exponentially fitted difference scheme is constructed in an equidistant mesh, which gives first order uniform convergence in the discrete maximum norm. The difference scheme is shown to be uniformly convergent to the continuous solution with respect to the perturbation parameter. A numerical example is solved using the presented method and compared the computed result with exact solution of the problem.     

Conservative difference methods for the Klein–Gordon–Zakharov equations

Firstly an implicit conservative finite difference scheme is presented for the initial-boundary problem of the one space dimensional Klein–Gordon–Zakharov (KGZ) equations. The existence of the difference solution is proved by Leray–Schauder fixed point theorem. It is proved by the discrete energy method that the scheme is uniquely solvable, unconditionally stable and second order convergent for U   in _l∞$l_{\infty }$ norm, and for N   in _l2$l_2$ norm on the basis of the priori estimates. Then an explicit difference scheme is proposed for the KGZ equations, on the basis of priori estimates and two important inequalities about norms, convergence of the difference solutions is proved. Because it is explicit and not coupled it can be computed by a parallel method. Numerical experiments with the two schemes are done for several test cases. Computational results demonstrate that the two schemes are accurate and efficient.