Convergence and stability of extended block boundary value methods for Volterra delay integro-differential equations

In this paper, we construct a class of extended block boundary value methods (B₂VMs) for Volterra delay integro-differential equations and analyze the convergence and stability of the methods. It is proven under the classical Lipschitz condition that an extended B₂VM is convergent of order p if the underlying boundary value methods (BVM) has consistent order p. The analysis shows that a B₂VM extended by an A-stable BVM can preserve the delay-independent stability of the underlying linear systems. Moreover, under some suitable conditions, the extended B₂VMs can also keep the delay-dependent stability of the underlying linear systems. In the end, we test the computational effectiveness by applying the introduced methods to the Volterra delay dynamical model of two interacting species, where the theoretical precision of the methods is further verified.     

Weak second order S-ROCK methods for Stratonovich stochastic differential equations

It is well known that the numerical solution of stiff stochastic ordinary differential equations leads to a step size reduction when explicit methods are used. This has led to a plethora of implicit or semi-implicit methods with a wide variety of stability properties. However, for stiff stochastic problems in which the eigenvalues of a drift term lie near the negative real axis, such as those arising from stochastic partial differential equations, explicit methods with extended stability regions can be very effective. In the present paper our aim is to derive explicit Runge–Kutta schemes for non-commutative Stratonovich stochastic differential equations, which are of weak order two and which have large stability regions. This will be achieved by the use of a technique in Chebyshev methods for ordinary differential equations.     

一类隐式的k+1阶线性k步法

本文首先给出了一类比Adams-Moulton方法的绝对稳定区间大的隐式k+1阶线性k步法基本公式.求出了3-9步新公式的分数形式的精确系数,阶数,局部截断误差主项系数和绝对稳定区间,然后构造了由4阶隐式新公式和同阶显式Nyström公式组合而成的预估-校正方法,比著名的Adams-Bashforth-Moulton和Nyström-Adams-Moulton预估校正方法的绝对稳定区间大,最后用对比数值试验对结果进行了验证.     

A family of multistep methods to integrate orbits on spheres

Summary A trajectory problem is an initial value problem where the interest lies in obtaining the curve traced by the solution, rather than in finding the actual correspondence between the values of the parameter and the points on that curve. This paper introduces a family of multi-stage, multi-step numerical methods to integrate trajectory problems whose solution is on a spherical surface. It has been shown that this kind of algorithms has good numerical properties: consistency, stability, convergence and others that are not standard. The latest ones make them a better choice for certain problems.     

一类显式的k阶线性k步法基本公式

本文给出了一类比Adams-Bashforth方法的局部截断误差主项系数小和绝对稳定区间大的显式k阶线性k步法基本公式.作者求出了公式的分数形式的精确系数,阶数和局部截断误差主项系数,给出了3-9步公式的绝对稳定区间,构造了由新公式的4阶显式公式和一个同阶隐式基本公式组合而成的特殊预估-校正方法,它的绝对稳定区间大于预估公式而且等于校正公式, 比著名的Adams-Bashforth-Moulton预估校正方法的绝对稳定区间大, 最后用数值试验对结果进行了验证,适合于求解常微分方程初值问题.     

A family of fully implicit Milstein methods for stiff stochastic differential equations with multiplicative noise

In this paper a family of fully implicit Milstein methods are introduced for solving stiff stochastic differential equations (SDEs). It is proved that the methods are convergent with strong order 1.0 for a class of SDEs. For a linear scalar test equation with multiplicative noise terms, mean-square and almost sure asymptotic stability of the methods are also investigated. We combine analytical and numerical techniques to get insights into the stability properties. The fully implicit methods are shown to be superior to those of the corresponding semi-implicit methods in term of stability property. Finally, numerical results are reported to illustrate the convergence and stability results.     

Nonlinear Stability of General Linear Methods

This paper considers the nonlinear stability of general linear methods. The diagonal matrix of an algebraically stable method is shown to be fixed. Readily testable necessary and sufficient conditions are obtained for algebraic stability and, more generally, for nonlinear stability in closed disk regions of the complex plane. It is shown that the latter criteria are satisfied by some explicit methods. It is also shown that certain methods, including some that are L-stable, suffer from nonautonomous instability along the negative real line near zero. A loose classification of methods is given according to nonlinear stability properties.     

Asymptotic stability of exact and discrete solutions for neutral multidelay-integro-differential equations

This paper concerns the long-time behavior of the exact and discrete solutions to a class of nonlinear neutral integro-differential equations with multiple delays. Using a generalized Halanay inequality, we give two sufficient conditions for the asymptotic stability of the exact solution to this class of equations. Runge–Kutta methods with compound quadrature rule are considered to discretize this class of equations with commensurate delays. Nonlinear stability conditions for the presented methods are derived. It is found that, under suitable conditions, this class of numerical methods retain the asymptotic stability of the underlying system. Some numerical examples that illustrate the theoretical results are given.     

Numerical stability analysis of differential equations with piecewise constant arguments with complex coefficients

In this paper we consider the analytical and numerical stability regions of Runge-Kutta methods for differential equations with piecewise continuous arguments with complex coefficients. It is shown that the analytical stability region contained in the numerical one is violated for a∉R by the geometric technique. And we give the conditions under which the analytical stability region is contained in the union of the numerical stability regions of two Runge-Kutta methods. At last, some experiments are given.     

延迟积分微分方程线性多步方法的稳定性分析

考虑带常延迟的延迟积分微分方程线性系统零解的渐近稳定性，本文采用拉格朗日插值的线性多步方法，探讨了系统数值方法的线性稳定性。证明了所有A-稳定且强零-稳定的Pouzet型线性多步方法能够保持原线性系统的延迟不依赖稳定性。     

Stability of Runge-Kutta-Pouzet methods for Volterra integro-differential equations with delays

This paper is concerned with the study of the stability of Runge-Kutta-Pouzet methods for Volterra integro-differential equations with delays. We are interested in the comparison between the analytical and numerical stability regions. First, we focus on scalar equations with real coefficients. It is proved that all Gauss-Pouzet methods can retain the asymptotic stability of the analytical solution. Then, we consider the multidimensional case. A new stability condition for the stability of the analytical solution is given. Under this condition, the asymptotic stability of Gauss-Pouzet methods is investigated.      

Thirty years of G-stability

The 1976 paper of G. Dahlquist, [13], has had a wide-ranging impact on our understanding of numerical methods for the solution of stiff differential equation systems. The present paper surveys some of the work of Dahlquist in this area. It also shows how this has led to contributions by other authors. In particular, the paper contains a review of non-linear stability for Runge–Kutta and general linear methods. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 65L05, 65L06, 65L20     

On implicit Runge-Kutta methods with high stage order

It is well known that high stage order is a desirable property for implicit Runge-Kutta methods. In this paper it is shown that it is always possible to construct ans-stage IRK method with a given stability function and stage orders−1 if the stability function is an approximation to the exponential function of at least orders. It is further indicated how to construct such methods as well as in which cases the constructed methods will be stiffly accurate.     

Convergence of linear multistep and one-leg methods for stiff nonlinear initial value problems

To prove convergence of numerical methods for stiff initial value problems, stability is needed but also estimates for the local errors which are not affected by stiffness. In this paper global error bounds are derived for one-leg and linear multistep methods applied to classes of arbitrarily stiff, nonlinear initial value problems. It will be shown that under suitable stability assumptions the multistep methods are convergent for stiff problems with the same order of convergence as for nonstiff problems, provided that the stepsize variation is sufficiently regular.     

The stability function for multistep collocation methods

Summary C-polynomials for rational approximation to the exponential function was introduced by Nørsett [7] to study stability properties of one-step methods. For one-step collocation methods theC-polynomial has a very simple form. In this paper we studyC-polynomials for multistep collocation methods and obtain results that generalize those in the one-step case, and provide a way to analyze linear stability of such methods.     

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.     

An extension of general linear methods

General Linear Methods (GLMs) were introduced as the natural generalizations of the classical Runge–Kutta and linear multistep methods. An extension of GLMs, so-called SGLMs (GLM with second derivative), was introduced to the case in which second derivatives, as well as first derivatives, can be calculated. In this paper, we introduce the definitions of consistency, stability and convergence for an SGLM. It will be shown that in SGLMs, stability and consistency together are equivalent to convergence. Also, by introducing a subclass of SGLMs, we construct methods of this subclass up to the maximal order which possess Runge–Kutta stability property and A-stability for implicit ones.     

Backward Error Analysis for Lie-Group Methods

Backward error analysis has proven to be very useful in stability analysis of numerical methods for ordinary differential equations. However the analysis has so far been undertaken in the Euclidean space or closed subsets thereof. In this paper we study differential equations on manifolds. We prove a backward error analysis result for intrinsic numerical methods. Especially we are interested in Lie-group methods. If the Lie algebra is nilpotent a global stability analysis can be done in the Lie algebra. In the general case we must work on the nonlinear Lie group. In order to show that there is a perturbed differential equation on the Lie group with a solution that is exponentially close to the numerical integrator after several steps, we prove a generalised version of Alekseev-Gr: obner's theorem. A major motivation for this result is that it implies many stability properties of Lie-group methods.     

求解延迟微分代数方程的多步Runge-Kutta方法的渐近稳定性

延迟微分代数方程(DDAEs)广泛出现于科学与工程应用领域．本文将多步Runge-Kutta方法应用于求解线性常系数延迟微分代数方程，讨论了该方法的渐近稳定性．数值试验表明该方法对求解DDAEs是有效的．     

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.