High order methods for the numerical integration of ordinary differential equations

Summary High order implicit integration formulae with a large region of absolute stability are developed for the approximate numerical integration of both stiff and non-stiff systems of ordinary differential equations. The algorithms derived behave essentially like one step methods and are demonstrated by direct application to certain particular examples.     

线性常微分方程的全局误差估计和优化求解方法

线性常微分方程初值问题求解在许多应用中起着重要作用.目前,已存在很多的数值方法和求解器用于计算离散网格点上的近似解,但很少有对全局误差(global error)进行估计和优化的方法.本文首先通过将离散数值解插值成为可微函数用来定义方程的残差;再给出残差与近似解的关系定理并推导出全局误差的上界;然后以最小化残差的二范数为目标将方程求解问题转化为优化求解问题;最后通过分析导出矩阵的结构,提出利用共轭梯度法对其进行求解.之后将该方法应用于滤波电路和汽车悬架系统等实际问题.实验分析表明,本文估计方法对线性常微分方程的初值问题的全局误差具有比较好的估计效果,优化求解方法能够在不增加网格点的情形下求解出线性常微分方程在插值解空间中的全局最优解.     

Trees and numerical methods for ordinary differential equations

This paper presents a review of the role played by trees in the theory of Runge–Kutta methods. The use of trees is in contrast to early publications on numerical methods, in which a deceptively simpler approach was used. This earlier approach is not only non-rigorous, but also incorrect. It is now known, for example, that methods can have different orders when applied to a single equation and when applied to a system of equations; the earlier approach cannot show this. Trees have a central role in the theory of Runge–Kutta methods and they also have applications to more general methods, involving multiple values and multiple stages.     

Local error control in codes for ordinary differential equations

There are several schemes for the control of local error which are seen in differential equation solvers. The analysis attempts to explain how the selection of a scheme influences the behavior of global error seen in high quality production codes. Two rules of thumb for estimating global errors are given theoretical support when used in conjunction with suitable codes. Substantial numerical experiments support the analysis and conclusions.     

A multi-step method for the numerical integration of ordinary differential equations

Summary In this paper we develop a multi-step method of order nine for obtaining an approximate solution of the initial value problemy'=f(x,y),y((x₀)=y ₀. The present method makes use of the second derivatives, namely, at the grid points. A sufficient criterion for the convergence of the iteration procedure is established. Analysis of the discretization error is performed. Various numerical examples are presented to demonstrate the practical usefulness of our integration method.

---

Zusammenfassung In dieser Arbeit entwickeln wir eine mehrschrittige Methode der neunten Ordnung, um eine angenäherte Lösung des Anfangswertproblemsy'=f(x, y), y(x ₀)=y ₀. zu erhalten. Diese Methode bedient sich der Ableitungen zweiter Ordnung an den Schnittpunkten, d.h. . Ein hinreichendes Kriterium für die Konvergenz des Iterationsprozesses wird aufgestellt. Eine Analyse des Diskretionsfehlers ist durchgeführt. Verschiedene numerische Beispiele sollen den praktischen Nutzen unserer Integrationsmethode beweisen.

     

Mean-square convergence of numerical methods for random ordinary differential equations

Numerical Algorithms - The aim of this work is to analyze the mean-square convergence rates of numerical schemes for random ordinary differential equations (RODEs). First, a relation between the...     

Order conditions for numerical methods for partitioned ordinary differential equations

Summary Motivated by the consideration of Runge-Kutta formulas for partitioned systems, the theory of P-series is studied. This theory yields the general structure of the order conditions for numerical methods for partitioned systems, and in addition for Nyström methods fory=f(y,y), for Rosenbrock-type methods with inexact Jacobian (W-methods). It is a direct generalization of the theory of Butcher series [7, 8]. In a later publication, the theory ofP-series will be used for the derivation of order conditions for Runge-Kutta-type methods for Volterra integral equations [1].     

Two sided error bounds for discretisation methods in ordinary differential equations

A wide class of discretisation methods for ordinary differential equations is introduced and a new concept of consistency, called optimal consistency, is defined. This permits convergence of order exactlyp (that is, two sided error bounds) when the method is optimally consistent of orderp. This is then related to the minimal and optimal stability functionals introduced by Spijker and Albrecht, and a new algebraic criterion is given for a discretisation method consistent of orderp to be convergent of orderp + 1. Finally it is shown that the original motivation for the idea of optimal consistency arises from discretisation methods for Volterra integral equations.     

Hybrid BDF methods for the numerical solutions of ordinary differential equations

In this article, we have presented the details of hybrid methods which are based on backward differentiation formula (BDF) for the numerical solutions of ordinary differential equations (ODEs). In these hybrid BDF, one additional stage point (or off-step point) has been used in the first derivative of the solution to improve the absolute stability regions. Stability domains of our presented methods have been obtained showing that all these new methods, we say HBDF, of order p, p = 2,4,..., 12, are A(α)-stable whereas they have wide stability regions comparing with those of some known methods like BDF, extended BDF (EBDF), modified EBDF (MEBDF), adaptive EBDF (A-EBDF), and second derivtive Enright methods. Numerical results are also given for five test problems.     

API stepsize control for the numerical solution of ordinary differential equations

A control-theoretic approach is used to design a new automatic stepsize control algorithm for the numerical integration of ODE's. The new control algorithm is more robust at little extra expense. Its improved performance is particularly evident when the stepsize is limited by numerical stability. Comparative numerical tests are presented.     

On the estimation of errors propagated in the numerical integration of ordinary differential equations

Summary In this paper we describe a method for the estimation of global errors. An heuristic condition of validity of the method is given and several applications are described in detail for problems of ordinary differential equations with either initial or two point boundary conditions solved by finite difference formulas. The main idea of the method can be extended to other type of problems and applications to a problem solved by spline functions and to some partial differential equations solved by finite differences methods are outlined.Some results of the present work have been reported at the Conference on the Numerical Solution of Differential Equations, held at the University of Dundee, Scotland in 1973     

One-step methods for ordinary differential equations

Summary It is proved that any consistent one-step method for solving the initial value problem for a first-order ordinary differential equation is convergent; no stability condition is required. An application is made to a similarly stated result, allowing part of the hypothesis in that case to be dropped.     

A block method for the numerical integration of stiff systems of ordinary differential equations

A new approach to the approximate numerical integration of stiff systems of first order ordinary differential equations is developed. In this approach several different formulae are applied in a well defined cyclic order to produce highly accurate integration schemes with infinite regions of absolute stability. The efficiency of these new algorithms, compared with that of certain existing ones, is demonstrated for some particular test problems.     

A posteriori error analysis of round-off errors in the numerical solution of ordinary differential equations

We prove sharp, computable error estimates for the propagation of errors in the numerical solution of ordinary differential equations. The new estimates extend previous estimates of the influence of data errors and discretization errors with a new term accounting for the propagation of numerical round-off errors, showing that the accumulated round-off error is inversely proportional to the square root of the step size. As a consequence, the numeric precision eventually sets the limit for the pointwise computability of accurate solutions of any ODE. The theoretical results are supported by numerically computed solutions and error estimates for the Lorenz system and the van der Pol oscillator.     

The dual weighted residuals approach to optimal control of ordinary differential equations

The methodology of dual weighted residuals is applied to an optimal control problem for ordinary differential equations. The differential equations are discretized by finite element methods. An a posteriori error estimate is derived and an adaptive algorithm is formulated. The algorithm is implemented in Matlab and tested on a simple model problem from vehicle dynamics.     

Nonlinear methods in solving ordinary differential equations

Some one step methods, based on nonpolynomial approximations, for solving ordinary differential equations are derived, and numerically tested. A comparison is made with existing methods.     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

The numerical solution of unstable ordinary differential equations

Invariant imbedding, or the Riccati transformation, has been used to solve unstable ordinary differential equations for a few years. This paper compares the above method with parallel or multiple shooting and a method using Chebyshev series. Parallel shooting gives a solution as accurate as that obtained using the Riccati transformation, in a comparable time.     

An implicit one-step method of high-order accuracy for the numerical integration of ordinary differential equations

For a differential equationdx/dt=f(t, x) withf _t (t, x),f _x (t, x) computable, the author presents a new one-step method of high-order accuracy. A rule of controlling the mesh size is given and the method is compared with the Runge-Kutta method in two numerical examples.Dedicated to Professor Dr. Dr. h. c. L. Collatz for his 60^th birthday