A Newton linearized compact finite difference scheme for one class of Sobolev equations

In this article, a Newton linearized compact finite difference scheme is proposed to numerically solve a class of Sobolev equations. The unique solvability, convergence, and stability of the proposed scheme are proved. It is shown that the proposed method is of order 2 in temporal direction and order 4 in spatial direction. Moreover, compare to the classical extrapolated Crank‐Nicolson method or the second‐order multistep implicit–explicit methods, the proposed scheme is easier to be implemented as it only requires one starting value. Finally, numerical experiments on one and two‐dimensional problems are presented to illustrate our theoretical results.     

Explicit multistep method for the numerical solution of stiff differential equations

An explicit multistep method of variable order for integrating stiff systems with high accuracy and low computational costs is examined. To stabilize the computational scheme, componentwise estimates are used for the eigenvalues of the Jacobian matrix having the greatest moduli. These estimates are obtained at preliminary stages of the integration step. Examples are given to demonstrate that, for certain stiff problems, the method proposed is as efficient as the best implicit methods.     

关于有限族Lipschitz映射多步Ishikawa迭代算法的收敛性及其应用

本文的目的是研究Lipschitz映射公共不动点问题.基于传统的Ishikawa迭代和Noor迭代方法,我们引入多步Ishikawa迭代算法,并且分别给出了该算法强收敛于有限族拟-Lipschitz映射和伪压缩映射公共不动点的充分必要条件.此外,我们证明了该算法强收敛到非扩张映射的公共不动点.作为应用,我们给出数值试验证实所得的结论.     

Computing Stability of Differential Equations with Bounded Distributed Delays

This paper deals with the stability analysis of scalar delay integro-differential equations (DIDEs). We propose a numerical scheme for computing the stability determining characteristic roots of DIDEs which involves a linear multistep method as time integration scheme and a quadrature method based on Lagrange interpolation and a Gauss–Legendre quadrature rule. We investigate to which extent the proposed scheme preserves the stability properties of the original equation. We derive and prove a sufficient condition for (asymptotic) stability of a DIDE (with a constant kernel) which we call RHP-stability. Conditions are obtained under which the proposed scheme preserves RHP-stability. We compare the obtained results with corresponding ones using Newton–Cotes formulas. Results of numerical experiments on computing the stability of DIDEs with constant and nonconstant kernel functions are presented.     

A multistep collocation method for solving advection equations with delay

Advection equations with delay are appeared in the modeling of the dynamics of structured cell populations. In this article, we construct an efficient two-dimensional multistep collocation method for the numerical solution of a class of advection equations with delay. Equations with aftereffect and equations with both aftereffect and retardation of a state variable are considered. Computability of the algorithm and convergence properties of the proposed numerical method are analyzed for solutions in appropriate Sobolev spaces, and it is shown that the proposed scheme enjoys the spectral accuracy. Numerical examples are given and comparison with other existing methods in the literature is made to demonstrate the efficiency, superiority and high accuracy of the presented method.     

Boundary Techniques for the Multistep Formulation of the Optimized Lax-Wendroff Method for Non-linear Hyperbolic Systems in Two Space Dimensions

Gourlay & Morris (1970) presented a multistep formulationof a scheme proposed by Strang (1968) for the numerical solutionof non-linear hyperbolic systems. This formulation did not takeaccount of given boundary data and led to instability in certainproblems. This note presents boundary techniques for the incorporationof the given boundary data and in numerical experiments, itis shown that the instabilities, which arose in the problemsof Gourlay & Morris, are prohibited.     

关于包含有限个强伪压缩映射的凸可行性问题解的迭代逼近

在Banach空间中,证明了多步迭代序列强收敛于有限个强伪压缩映射的公共不动点.同时,给出了有限个(强)增生算子方程公共解的强收敛定理.所得结果推广和改进了许多重要结果.     

A direct variable step block multistep method for solving general third-order ODEs

This paper discusses a direct three-point implicit block multistep method for direct solution of the general third-order initial value problems of ordinary differential equations using variable step size. The method is based on a pair of explicit and implicit of Adams type formulas which are implemented in PE(CE) ^t mode and in order to avoid calculating divided difference and integration coefficients all the coefficients are stored in the code. The method approximates the numerical solution at three equally spaced points simultaneously. The Gauss Seidel approach is used for the implementation of the proposed method. The local truncation error of the proposed scheme is studied. Numerical examples are given to illustrate the efficiency of the method.     

Numerical study using explicit multistep Galerkin finite element method for the MRLW equation

In this article, an explicit multistep Galerkin finite element method for the modified regularized long wave equation is studied. The discretization of this equation in space is by linear finite elements, and the time discretization is based on explicit multistep schemes. Stability analysis and error estimates of our numerical scheme are derived. Numerical experiments indicate the validation of the scheme by L₂– and L_∞– error norms and three invariants of motion.4 © 2015 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1875–1889, 2015     

On the stability and error structure of BDF schemes applied to linear parabolic evolution equations

We continue the work of various authors on the stability and error structure of multistep schemes applied to linear evolution equations. BDF schemes are considered, and, as far as reasonable, explicit expressions for all occurring bounds are specified, exploiting prior work on the location of characteristic roots. The 2-step BDF scheme is considered in particular detail, and for problems of sectorial type, an asymptotic error expansion is derived based on damping properties of the scheme.     

Fractional Linear Multistep Methods for Abel-Volterra Integral Equations of the First Kind

Fractional powers of linear multistep methods are suggestedfor the numerical solution of weakly singular Volterra integralequations of the first kind. The proposed methods are convergentof the order of the underlying multistep method. The stabilityproperties are directly related to those of the multistep method.     

Modified Implicit–Explicit BDF Methods for Nonlinear Parabolic Equations

Implicit–explicit multistep methods for nonlinear parabolic equations were recently analyzed. If the implicit scheme is one of the backward differentiation formulae (BDF) of order up to six, then the corresponding implicit–explicit method of the same order is stable provided the stability constant is less than a specific scheme-dependent constant. Based on BDF, implicit methods are constructed such that the corresponding implicit–explicit scheme of the same order exhibits improved stability properties.     

Variable multistep methods for delay differential equations

In this paper, variable stepsize multistep methods for delay differential equations of the type y(t) = f(t, y(t), y(t − τ)) are proposed. Error bounds for the global discretization error of variable stepsize multistep methods for delay differential equations are explicitly computed. It is proved that a variable multistep method which is a perturbation of strongly stable fixed step size method is convergent.     

Modified Jarratt method with sixth-order convergence

In this paper, we present a variant of Jarratt method with order of convergence six for solving non-linear equations. Per iteration the method requires two evaluations of the function and two of its first derivatives. The new multistep iteration scheme, based on the new method, is developed and numerical tests verifying the theory are also given.     

The arbitrary order implicit multistep schemes of exponential fitting and their applications

We develop the arbitrary order implicit multistep schemes of exponential fitting (EF) for systems of ordinary differential equations. We use an explicit EF scheme to predict an approximation, and then use an implicit EF scheme to correct this prediction. This combination is called a predictor–corrector EF method. We demonstrate the accuracy and efficiency of the new predictor–corrector methods via application to a variety of test cases and comparison with other analytical and numerical results. The numerical results show that the schemes are highly accurate and computationally efficient.     

Stability of implicit-explicit linear multistep methods for ordinary and delay differential equations

Stability properties of implicit-explicit (IMEX) linear multistep methods for ordinary and delay differential equations are analyzed on the basis of stability regions defined by using scalar test equations. The analysis is closely related to the stability analysis of the standard linear multistep methods for delay differential equations. A new second-order IMEX method which has approximately the same stability region as that of the IMEX Euler method, the simplest IMEX method of order 1, is proposed. Some numerical results are also presented which show superiority of the new method.      

von Neumann stability conditions for the convection-diffusion eqation

A method is presented to easily derive von Neumann stabilityconditions for a wide variety of time discretization schemesfor the convection-diffusion equation. Spatial discretizationis by the _K-scheme or the fourth-order central scheme. The useof the method is illustrated by application to multistep, Runge-Kuttaand implicit-explicit methods, such as are in current use forflow computations, and for which, with few exceptions, no sufficientvon Neumann stability results are available.     

Stability of Richtmyer Type Difference Schemes in any Finite Number of Space Variables and Their Comparison with Multistep Strang Schemes

The stability of generalized Richtmyer two step difference schemesin any finite number of space variables is examined and a sufficientstability condition obtained for each scheme. In certain casesthis condition is shown to be optimal C.F.L. The efficiencyof these schemes in solving time dependent problems in two andthree space variables is examined and the schemes are seen tocompare favourably with the corresponding multistep forms ofStrang's schemes.     

Block‐centered upwind multistep difference method and convergence analysis for numerical simulation of oil reservoir

The three‐dimensional displacement of two‐phase flow in porous media is a preliminary problem of numerical simulation of energy science and mathematics. The mathematical model is formulated by a nonlinear system of partial differential equations to describe incompressible miscible case. The pressure is defined by an elliptic equation, and the concentration is defined by a convection‐dominated diffusion equation. The pressure generates Darcy velocity and controls the dynamic change of concentration. We adopt a conservative block‐centered scheme to approximate the pressure and Darcy velocity, and the accuracy of Darcy velocity is improved one order. We use a block‐centered upwind multistep method to solve the concentration, where the time derivative is approximated by multistep method, and the diffusion term and convection term are treated by a block‐centered scheme and an upwind scheme, respectively. The composite algorithm is effective to solve such a convection‐dominated problem, since numerical oscillation and dispersion are avoided and computational accuracy is improved. Block‐centered method is conservative, and the concentration and the adjoint function are computed simultaneously. This physical nature is important in numerical simulation of seepage fluid. Using the convergence theory and techniques of priori estimates, we derive optimal estimate error. Numerical experiments and data show the support and consistency of theoretical result. The argument in the present paper shows a powerful tool to solve the well‐known model problem.     

A fast numerical method for solving coupled Burgers' equations

A new fast numerical scheme is proposed for solving time‐dependent coupled Burgers' equations. The idea of operator splitting is used to decompose the original problem into nonlinear pure convection subproblems and diffusion subproblems at each time step. Using Taylor's expansion, the nonlinearity in convection subproblems is explicitly treated by resolving a linear convection system with artificial inflow boundary conditions that can be independently solved. A multistep technique is proposed to rescue the possible instability caused by the explicit treatment of the convection system. Meanwhile, the diffusion subproblems are always self‐adjoint and coercive at each time step, and they can be efficiently solved by some existing preconditioned iterative solvers like the preconditioned conjugate galerkin method, and so forth. With the help of finite element discretization, all the major stiffness matrices remain invariant during the time marching process, which makes the present approach extremely fast for the time‐dependent nonlinear problems. Finally, several numerical examples are performed to verify the stability, convergence and performance of the new method.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1823–1838, 2017