Convergence of parallel multistep hybrid methods for singular perturbation problems

Parallel multistep hybrid methods (PHMs) can be implemented in parallel with two processors, accordingly have almost the same computational speed per integration step as BDF methods of the same order with the same stepsize. But PHMs have better stability properties than BDF methods of the same order for stiff differential equations. In the present paper, we give some results on error analysis of A(α)-stable PHMs for the initial value problems of ordinary differential equations in singular perturbation form. Our convergence results are similar to those of linear multistep methods (such as BDF methods), i.e. the convergence orders are equal to their classical convergence orders, and no order reduction occurs. Some numerical examples also confirm our results.     

A Class of Multistep Method Containing Second Order Derivatives for Solving Stiff Ordinary Differential Equations

In this paper a general k-step k-order multistep method containing derivatives of second order is given. In particular, a class of k-step (k+1)th-order stiff stable multistep methods for k=3-9 is constructed. Under the same accuracy, these methods are possessed of a larger absolute stability region than those of Gear's [1] and Enright's [2]. Hence they are suitable for solving stiff initial value problems in ordinary differential equations.     

Numerical solution by LMMs of stiff delay differential systems modelling an immune response

Summary. We consider the application of linear multistep methods (LMMs) for the numerical solution of initial value problem for stiff delay differential equations (DDEs) with several constant delays, which are used in mathematical modelling of immune response. For the approximation of delayed variables the Nordsieck's interpolation technique, providing an interpolation procedure consistent with the underlying linear multistep formula, is used. An analysis of the convergence for a variable-stepsize and structure of the asymptotic expansion of global error for a fixed-stepsize is presented. Some absolute stability characteristics of the method are examined. Implementation details of the code DIFSUB-DDE, being a modification of the Gear's DIFSUB, are given. Finally, an efficiency of the code developed for solution of stiff DDEs over a wide range of tolerances is illustrated on biomedical application model. Received March 23, 1994 / Revised version received March 13, 1995     

On the construction of high order <Emphasis Type="Italic">A</Emphasis>(<Emphasis Type="Italic">α</Emphasis>)-stable hybrid linear multistep methods for stiff IVPs in ODEs

In this paper, we present a class of A(α)-stable hybrid linear multistep methods for numerical solving stiff initial value problems (IVPs) in ordinary differential equations (ODEs). The method considered uses a second derivative like the Enright’s second derivative linear multistep methods for stiff IVPs in ODEs.     

A boundary value approach to the numerical solution of initial value problems by multistep methos †

A boundary value appraoch to the numerical solution of initial value problems by means of linear multistep methods is presented. This theory is based on the study of linear difference equations when their general solution is computed by imposing boundary conditions. All the main stability and convergence properties of the obtained methods are investigated abd compared to those of the classical multistep methods. Then, as an example, new itegration formulas, called extended trapezoidal rules, are derived. For any order they have the same stability properties (in the sense of the definitions given in this paper) of the trapezoidal rule, which is the first method in this class. Some numerical examples are presented to confirm the theoretical expectations and to allow us to trust a future code based on boundary value methods.     

Explicit multistep methods with extended stability domains

Explicit multistep methods for solving Cauchy problems are examined. The proposed methods have their stability domains extended along the real axis and can be an alternative to one-step Runge-Kutta-Chebyshev methods when stiff problems are solved.     

Optimal subsets in the stability regions of multistep methods

Numerical Algorithms - In this work, we study the stability regions of linear multistep or multiderivative multistep methods for initial value problems by using techniques that are straightforward...     

Convergence of rational multistep methods of Adams-Padé type

Rational generalizations of multistep schemes, where the linear stiff part of a given problem is treated by an A-stable rational approximation, have been proposed by several authors, but a reasonable convergence analysis for stiff problems has not been provided so far. In this paper we directly relate this approach to exponential multistep methods, a subclass of the increasingly popular class of exponential integrators. This natural, but new interpretation of rational multistep methods enables us to prove a convergence result of the same quality as for the exponential version. In particular, we consider schemes of rational Adams type based on A-acceptable Padé approximations to the matrix exponential. A numerical example is also provided.     

一类带有差分扰动项的显式线性多步法的讨论

一、方法的形成 求解常微分程初值问题 y′=f(x,y),y(a)= y_0,x∈[a b).(1.0)一般形式的显式k阶线性多步法表成(见[3]):     

一类多步并行Runge—Kutta公式

本文构造了一类适合在多处理机系统上实现的并行Ｒｕｎｇｅ－Ｋｕｔｔａ公式，对于其中的具体公式证明了收敛性，给出它的稳定区域，数值例子表明，该公式可以有效地求解常微分方程初值问题。     

On the convergence of Runge–Kutta methods for stiff non linear differential equations

Summary. This paper studies the convergence properties of general Runge–Kutta methods when applied to the numerical solution of a special class of stiff non linear initial value problems. It is proved that under weaker assumptions on the coefficients of a Runge–Kutta method than in the standard theory of B-convergence, it is possible to ensure the convergence of the method for stiff non linear systems belonging to the above mentioned class. Thus, it is shown that some methods which are not algebraically stable, like the Lobatto IIIA or A-stable SIRK methods, are convergent for the class of stiff problems under consideration. Finally, some results on the existence and uniqueness of the Runge–Kutta solution are also presented. Received November 18, 1996 / Revised version received October 6, 1997     

Implicit runge-kutta methods for differential inclusions

This paper is concerned with the application of implicit Runge-Kutta methods suitable for stiff initial value problems to initial value problems for differential inclusions with upper semicontinuous right-hand sides satisfying a uniform one-sided Lipschitz condition and a growth condition. The problems could stem from differential equations with state discontinuous right-hand sides. It is shown that there exist methods with higher order of convergence on intervals where the solution is smooth enough. Globally we get at least the order one.     

B-convergence of a Class of Multistep Multiderivative Methods

Ｂ－ｃｏｎｖｅｒｇｅｎｃｅｏｆａＣｌａｓｓｏｆＭｕｌｔｉｓｔｅｐＭｕｌｔｉｄｅｒｉｖａｔｉｖｅＭｅｔｈｏｄｓＨｕａｎｇＣｈｅｎｇｍｉｎｇ（黄乘明）（ＣｏｍｐｕｔｉｎｇＣｅｎｔｅｒ，ＳｈａｏｙａｎｇＴｅａｃｈｅｒ＇ｓＣｏｌｌｅｇｅ，Ｈｕｎａｎ，４２２０...     

Asymptotic stability of linear multistep methods for nonlinear neutral delay differential equations

This paper is concerned with the numerical solution to initial value problems of nonlinear delay differential equations of neutral type. We use A-stable linear multistep methods to compute the numerical solution. The asymptotic stability of the A-stable linear multistep methods when applied to the nonlinear delay differential equations of neutral type is investigated, and it is shown that the A-stable linear multistep methods with linear interpolation are GAS-stable. We validate our conclusions by numerical experiments.     

Numerical solution of random differential initial value problems: Multistep methods

This paper deals with the construction of numerical methods of random initial value problems. Random linear multistep methods are presented and sufficient conditions for their mean square convergence are established. Main statistical properties of the approximations processes are computed in several illustrative examples. Copyright © 2010 John Wiley & Sons, Ltd.     

Nonlinear Stability of General Linear Methods

This paper is devoted to a study of stability of general linear methods for the numerical solution of nonlinear stiff initial value problems in a Hilbert space. New stability concepts are introduced. A criterion of weak algebraic stability is established, which is an improvement and extension of the existing criteria of algebraic stability.     

Partitioned adaptive Runge-Kutta methods and their stability

Summary This paper deals with the solution of partitioned systems of nonlinear stiff differential equations. Given a differential system, the user may specify some equations to be stiff and others to be nonstiff. For the numerical solution of such a system partitioned adaptive Runge-Kutta methods are studied. Nonstiff equations are integrated by an explicit Runge-Kutta method while an adaptive Runge-Kutta method is used for the stiff part of the system.The paper discusses numerical stability and contractivity as well as the implementation and usage of such compound methods. Test results for three partitioned stiff initial value problems for different tolerances are presented.     

求解非线性刚性初值问题的隐显线性多步方法的误差分析

隐显线性多步方法由隐式线性多步方法和显式线性多步法组合而成.本文主要讨论求解满足单边Lipschitz条件的非线性刚性初值问题和一类奇异摄动初值问题的隐显线性多步方法的误差分析.最后,由数值例子验证了所获的理论结果的正确性及方法处理这两类问题的有效性.     

Inverse linear multistep methods for the numerical solution of initial value problems of second order differential equations

In this paper inverse linear multistep methods for the numerical solution of second order differential equations are presented. Local accuracy and stability of the methods are defined and discussed. The methods are applicable to a class of special second order initial value problems, not explicitly involving the first derivative. The methods are not convergent, but yield good numerical results if applied to problems they are designed for. Numerical results are presented for both the linear and nonlinear initial value problems.     

Some Stability Inequalities for Compact Finite Difference Schemes

For finite difference schemes of compact form on nonuniform grids approximating m-th order two-point boundary value problems stability inequalities are proved which use a norm analogous to the Spijker-norm in the case of multistep methods. The results are applied to a number of finite difference schemes for which they establish a higher order of convergence than naively expected.