NP-stability of Runge-Kutta methods based on classical quadrature

Recently Bellen, Jackiewicz and Zennaro have studied stability properties of Runge-Kutta (RK) methods for neutral delay differential equations using a scalar test equation. In particular, they have shown that everyA-stable collocation method isNP-stable, i.e., the method has an analogous stability property toA-stability with respect to the test equation. Consequently, the Gauss, Radau IIA and Lobatto IIIA methods areNP-stable. In this paper, we examine the stability of RK methods based on classical quadrature by a slightly different approach from theirs. As a result, we prove that the Radau IA and Lobatto IIIC methods equipped with suitable continuous extensions are alsoNP-stable by virtue of fundamental notions related to those methods such as simplifying conditions, algebraic stability, and theW-transformation.     

Stability of the Radau IA and Lobatto IIIC methods for delay differential equations

Recently, we have proved that the Radau IA and Lobatto IIIC methods are P-stable, i.e., they have an analogous stability property to A-stability with respect to scalar delay differential equations (DDEs). In this paper, we study stability of those methods applied to multidimensional DDEs. We show that they have a similar property to P-stability with respect to multidimensional equations which satisfy certain conditions for asymptotic stability of the zero solutions. The conditions are closely related to stability criteria for DDEs considered in systems theory. Received October 8, 1996 / Revised version received February 21, 1997     

Delay-dependent stability of high order Runge–Kutta methods

This paper is concerned with the study of the delay-dependent stability of Runge–Kutta methods for delay differential equations. First, a new sufficient and necessary condition is given for the asymptotic stability of analytical solution. Then, based on this condition, we establish a relationship between τ(0)-stability and the boundary locus of the stability region of numerical methods for ordinary differential equations. Consequently, a class of high order Runge–Kutta methods are proved to be τ(0)-stable. In particular, the τ(0)-stability of the Radau IIA methods is proved.     

On the practical value of the notion ofBN-stability

The oldest concept of unconditional stability of numerical integration methods for ordinary differential systems is that ofA-stability. This concept is related to linear systems having constant coefficients and has been introduced by Dahlquist in 1963. More recently, since another contribution of Dahlquist in 1975, there has been much interest in unconditional stability properties of numerical integration methods when applied to non-linear dissipative systems (G-stability,BN-stability,A-contractivity). Various classes of implicit Runge-Kutta methods have already been shown to beBN-stable. However, contrary to the property ofA-stability, when implementing such a method for practical use this unconditional stability property may be lost. The present note clarifies this for a class of diagonally implicit methods and shows at the same time that Rosenbrock's method is notBN-stable.     

A stability property ofA-stable natural Runge-Kutta methods for systems of delay differential equations

A natural Runge-Kutta method is a special type of Runge-Kutta method for delay differential equations (DDEs); it is known that any one-step collocation method is equivalent to one of such methods. In this paper, we consider a linear constant-coefficient system of DDEs with a constant delay, and discuss the application of natural Runge-Kutta methods to the system. We show that anA-stable method preserves the asymptotic stability property of the analytical solutions of the system.     

Stability of implicit Runge-Kutta methods for nonlinear stiff differential equations

Under the assumption that an implicit Runge-Kutta method satisfies a certain stability estimate for linear systems with constant coefficientsl ₂-stability for nonlinear systems is proved. This assumption is weaker than algebraic stability since it is satisfied for many methods which are not evenA-stable. Some local smoothness in the right hand side of the differential equation is needed, but it may have a Jacobian and higher derivatives with large norms. The result is applied to a system derived from a strongly nonlinear parabolic equation by the method of lines.     

Stability of ZakianI MN recursions for linear delay differential equations

Long sequences of linear delay differential equations (DDEs) frequently occur in the design of control systems with delays using iterative-numerical methods, such as the method of inequalities. ZakianI _MN recursions for DDEs are suitable for solving this class of problems, since they are reliable and provide results to the desired accuracy, economically even if the systems are stiff. This paper investigates the numerical stability property of theI _MN recursions with respect to Barwell's concept ofP-stability. The result shows that the recursions using full gradeI _MN approximants areP-stable if, and only if,N−2≤M≤N−1.     

A-stability of Runge-Kutta methods for systems with additive noise

Numerical stability of both explicit and implicit Runge-Kutta methods for solving ordinary differential equations with an additive noise term is studied. The concept of numerical stability of deterministic schemes is extended to the stochastic case, and a stochastic analogue of Dahlquist'sA-stability is proposed. It is shown that the discretization of the drift term alone controls theA-stability of the whole scheme. The quantitative effect of implicitness uponA-stability is also investigated, and stability regions are given for a family of implicit Runge-Kutta methods with optimal order of convergence.This author was partially supported by the Italian Consiglio Nazionale delle Ricerche.     

Linear and non-linear stability for general linear methods

We explore the interrelation between a number of linear and non-linear stability properties. The weakest of these,A-stability, is shown by counterexample not to imply any of the various versions ofAN-stability introduced in the paper and two of these properties, weak and strongAN-stability, are also shown not to be equivalent. Finally, another linear stability property defined here, EuclideanAN-stability, is shown to be equivalent to algebraic stability.     

Stability of Runge-Kutta methods for the generalized pantograph equation

Summary. This paper deals with stability properties of Runge-Kutta (RK) methods applied to a non-autonomous delay differential equation (DDE) with a constant delay which is obtained from the so-called generalized pantograph equation, an autonomous DDE with a variable delay by a change of the independent variable. It is shown that in the case where the RK matrix is regular stability properties of the RK method for the DDE are derived from those for a difference equation, which are examined by similar techniques to those in the case of autonomous DDEs with a constant delay. As a result, it is shown that some RK methods based on classical quadrature have a superior stability property with respect to the generalized pantograph equation. Stability of algebraically stable natural RK methods is also considered. Received May 5, 1998 / Revised version received November 17, 1998 / Published online September 24, 1999     

A-stable block implicit one-step methods

A class of methods for solving the initial value problem for ordinary differential equations is studied. We developr-block implicit one-step methods which compute a block ofr new values simultaneously with each step of application. These methods are examined for the property ofA-stability. A sub-class of formulas is derived which is related to Newton-Cotes quadrature and it is shown that for block sizesr=1,2,..., 8 these methods areA-stable while those forr=9,10 are not. We constructA-stable formulas having arbitrarily high orders of accuracy, even stiffly (strongly)A-stable formulas.     

A 0-Stability and stiff stability of Brown's multistep multiderivative methods

Summary Brown [1] introducedk-step methods usingl derivatives. Necessary and sufficient conditions forA ₀-stability and stiff stability of these methods are given. These conditions are used to investigate for whichk andl the methods areA ₀-stable. It is seen that for allk andl withk1.5 (l+1) the methods areA ₀-stable and stiffly stable. This result is conservative and can be improved forl sufficiently large. For smallk andl A ₀-stability has been determined numerically by implementing the necessary and sufficient condition.     

On the stability of Runge-Kutta methods for delay integral equations

Summary We present a class of Runge-Kutta methods for the numerical solution of a class of delay integral equations (DIEs) described by two different kernels and with a fixed delay . The stability properties of these methods are investigated with respect to a test equation with linear kernels depending on complex parameters. The results are then applied to collocation methods. In particular we obtain that any collocation method for DIEs, resulting from anA-stable collocation method for ODEs, with a stepsize which is submultiple of the delay , preserves the asymptotic stability properties of the analytic solutions.This work was supported by CNR (Italian National Council of Research)     

High orderP-stable formulae for the numerical integration of periodic initial value problems

Summary Recently there has been considerable interest in the approximate numerical integration of the special initial value problemy=f(x, y) for cases where it is known in advance that the required solution is periodic. The well known class of Störmer-Cowell methods with stepnumber greater than 2 exhibit orbital instability and so are often unsuitable for the integration of such problems. An appropriate stability requirement for the numerical integration of periodic problems is that ofP-stability. However Lambert and Watson have shown that aP-stable linear multistep method cannot have an order of accuracy greater than 2. In the present paper a class of 2-step methods of Runge-Kutta type is discussed for the numerical solution of periodic initial value problems.P-stable formulae with orders up to 6 are derived and these are shown to compare favourably with existing methods.     

Unconditionally stable explicit methods for parabolic equations

Summary This paper discussesrational Runge-Kutta methods for stiff differential equations of high dimensions. These methods are explicit and in addition do not require the computation or storage of the Jacobian. A stability analysis (based onn-dimensional linear equations) is given. A second orderA ₀-stable method with embedded error control is constructed and numerical results of stiff problems originating from linear and nonlinear parabolic equations are presented.     

Generalized Runge-Kutta methods of order four with stepsize control for stiff ordinary differential equations

Summary GeneralizedA()-stable Runge-Kutta methods of order four with stepsize control are studied. The equations of condition for this class of semiimplicit methods are solved taking the truncation error into consideration. For application anA-stable and anA(89.3°)-stable method with small truncation error are proposed and test results for 25 stiff initial value problems for different tolerances are discussed.     

An extension ofA-stability to alternating direction implicit methods

Completely implicit, noniterative, finite-difference schemes have recently been developed by several authors for nonlinear, multidimensional systems of hyperbolic and mixed hyperbolic-parabolic partial differential equations. The method of Douglas and Gunn or the method of approximate factorization can be used to reduce the computational problem to a sequence of one-dimensional or alternating direction implicit (ADI) steps. Since the eigenvalues of partial differential equations (for example, the equations of compressible fluid dynamics) are often widely distributed with large imaginary parts,A-stable integration formulas provide ideal time-differencing approximations. In this paper it is shown that if anA-stable linear multistep method is used to integrate a model two-dimensional hyperbolic-parabolic partial differential equation, then one can always construct an ADI scheme by the method of approximate factorization which is alsoA-stable, i.e., unconditionally stable. A more restrictive result is given for three spatial dimensions. Since necessary and sufficient conditions forA-stability can easily be determined by using the theory of positive real functions, the stability analysis of the factored partial difference equations is reduced to a simple algebraic test.The main results of this paper were presented at the SIAM National Meeting, Madison, Wis., May 24 to 26, 1978, and section 9 was part of a presentation at the 751st Meeting of the American Mathematical Society, San Luis Obispo, California, Nov. 11 to 12, 1977.     

A- andB-stability for Runge-Kutta methods-characterizations and equivalence

Summary Using a special representation of Runge-Kutta methods (W-transformation), simple characterizations ofA-stability andB-stability have been obtained in [9, 8, 7]. In this article we will make this representation and their conclusions more transparent by considering the exact Runge-Kutta method. Finally we demonstrate by a numerical example that for difficult problemsB-stable methods are superior to methods which are onlyA-stable.Talk, presented at the conference on the occasion of the 25th anniversary of the founding ofNumerische Mathematik, TU Munich, March 19–21, 1984     

On theA-stability of implicit Runge-Kutta processes

A new technique to calculate the characteristic functions and to examine theA-stability of implicit Runge-Kutta processes is presented. This technique is based on a direct algebraic approach and an application of theC-polynomial theory of Nørsett. New processes are suggested. These processes can be exponentially fitted in anA-stable manner.