P-stable methods for periodic initial value problems of second order differential equations

A class ofP-stable finite difference methods is discussed for solving initial value problems of second order differential equations which have periodic solutions. The methods depend upon a parameterp>0, and reduce to the classical Störmer-Cowell methods forp=0. It is shown that whenp is chosen for linear problems as the square of the frequency of the periodic solution, the methods areP-stable and for some suitable choice ofp, they have extended finite interval of periodicity.     

EfficientP-stable methods for periodic initial value problems

Efficient families ofP-stable formulae are developed for the numerical integration of periodic initial value problems where the required solution has an unknown period. Formulae of orders 4 and 6 requiring respectively 2 and 4 function evaluations per step are derived and some numerical results are given.     

On the integration of stiff systems of O.D.E.s using extended backward differentiation formulae

Summary A class of extended backward differentiation formulae suitable for the approximate numerical integration of stiff systems of first order ordinary differential equations is derived. An algorithm is described whereby the required solution is predicted using a conventional backward differentiation scheme and then corrected using an extended backward differentiation scheme of higher order. This approach allows us to developL-stable schemes of order up to 4 andL()-stable schemes of order up to 9. An algorithm based on the integration formulae derived in this paper is illustrated by some numerical examples and it is shown that it is often superior to certain existing algorithms.     

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.     

Hybrid numerical methods for periodic initial value problems involving second-order differential equations

Computer simulation of problems in celestial mechanics often leads to the numerical solution of the system of second-order initial value problems with periodic solutions. When conventional methods are applied to obtain the solution, the time increment must be limited to a value of the order of the reciprocal of the frequency of the periodic solution.In this paper hybrid methods of orders four and six which are P-stable are developed. Further, the adaptive hybrid methods of polynomial order four and trigonometric order one have also been discussed. The numerical results for the undamped Duffing equation with a forced harmonic function are listed.     

Iterative continuation and the solution of nonlinear two-point boundary value problems

In this paper we present a unified function theoretic approach for the numerical solution of a wide class of two-point boundary value problems. The approach generates a class of continuous analog iterative methods which are designed to overcome some of the essential difficulties encountered in the numerical treatment of two-point problems. It is shown that the methods produce convergent sequences of iterates in cases where the initial iterate (guess),x ₀, is far from the desired solution. The results of some numerical experiments using the methods on various boundary value problems are presented in a forthcoming paper.     

Strong Stability and Non-smooth Data Error Estimates for Discretizations of Linear Parabolic Problems

We study smoothing properties of discretizations of a linear parabolic initial boundary value problem with a possibly non-selfadjoint elliptic operator. The solution at time t > 0 of this problem, as well as its time derivatives, are in L _r for initial values in L _s even when r > s. We show that similar strong stability results hold for discrete solutions obtained by discretizing in space by linear finite elements and in time by a class of A()-stable implicit rational multistep methods (including single step methods as a special case) with good smoothing properties, as well as for certain combinations of single step methods. Most of our results are derived from the corresponding L ₂-bounds, shown by semigroup techniques, together with a discrete Gagliardo-Nirenberg inequality, and generalize previously known estimates with respect to admissible problems and time discretization methods. Our techniques make it possible to obtain, e.g., supremum norm error estimates for initial data which are only required to be in L ₁.     

A class of one-step one-stage methods for stiff systems of ordinary differential equations

A new class of one-step one-stage methods (ABC-schemes) designed for the numerical solution of stiff initial value problems for ordinary differential equations is proposed and studied. The Jacobian matrix of the underlying differential equation is used in ABC-schemes. They do not require iteration: a system of linear algebraic equations is once solved at each integration step. ABC-schemes are A- and L-stable methods of the second order, but there are ABC-schemes that have the fourth order for linear differential equations. Some aspects of the implementation of ABC-schemes are discussed. Numerical results are presented, and the schemes are compared with other numerical methods.     

New class of hybrid BDF methods for the computation of numerical solutions of IVPs

A new class of hybrid BDF-like methods is presented for solving systems of ordinary differential equations (ODEs) by using the second derivative of the solution in the stage equation of class 2 + 1hybrid BDF-like methods to improve the order and stability regions of these methods. An off-step point, together with two step points, has been used in the first derivative of the solution, and the stability domains of the new methods have been obtained by showing that these methods are A-stable for order p, p =?3,4,5,6,7and A(α)-stable for order p, 8 ≤ p ≤?14. The numerical results are also given for four test problems by using variable and fixed step-size implementations.     

Convergence of the Lambert-McLeod trajectory solver and of the celf method

Summary A trajectory problem is an initial value problemd y/dt=f(y),y(0)= where the interest lies in obtaining the curve traced by the solution (the trajectory), rather than in finding the actual correspondanc between values of the parametert and points on that curve. We prove the convergence of the Lambert-McLeod scheme for the numerical integration of trajectory problems. We also study the CELF method, an explicit procedure for the integration in time of semidiscretizations of PDEs which has some useful conservation properties. The proofs rely on the concept of restricted stability introduced by Stetter. In order to show the convergence of the methods, an idea of Strang is also employed, whereby the numerical solution is compared with a suitable perturbation of the theoretical solution, rather than with the theoretical solution itself.     

Adams methods for neutral functional differential equations

Summary In this paper Adams type methods for the special case of neutral functional differential equations are examined. It is shown thatk-step methods maintain orderk+1 for sufficiently small step size in a sufficiently smooth situation. However, when these methods are applied to an equation with a non-smooth solution the order of convergence is only one. Some computational considerations are given and numerical experiments are presented.     

Improvement of numerical solution of boundary layer problems by incorporation of asymptotic approximations

Summary A method for improvement of the numerical solution of differential equations by incorporation of asymptotic approximations is investigated for a class of singular perturbation problems.Uniform error estimates are derived for this method when implemented in known difference schemes and applied to linear second order O.D.E.'s. An improvement by a factor of ⁿ⁺¹ can be obtained (where is the small parameter andn is the order of the asymptotic approximation) for a small amount of extra work. Numerical experiments are presented.     

Precisely A(α)-Stable One-Leg Multistep Methods

One-Leg Multistep (OLM) methods for initial value problems in ODEs use a nonlinear multistep formula to compute the solution at the next integration point. This paper shows that there exists an evaluation point t ^* which gives an OLM formula more precise than BDF's and (almost) precisely A()-stable for a k-step method (k6), and whose stability angle is essentially similar to BDF's. The stability region can be further improved by applying the corrector idea of Klopfenstein.This revised version was published online in October 2005 with corrections to the Cover Date.     

Phase properties of high order,almostP-stable formulae

Cash [3] and Chawla [4] derive families of two-step, symmetric,P-stable (hybrid) methods for solving periodic initial value problems numerically. Chawla demonstrates the existence of a family of fourth order methods while Cash derives both fourth order and sixth order methods. In this paper, we demonstrate that these methods, which are dependent on certain free parameters, havein phase particular solutions. We consider more general families of 2-step symmetric methods, including those derived by Cash and Chawla, and show that some members of these families have higher order phase lag and are almostP-stable. We also consider how the free parameters can be chosen so as to lead to an efficient implementation of the fourth order methods for large periodic systems.Most of this work was carried out while the author was at the Department of Computer Studies, University of Leeds, Leeds, England.     

Gaussian collocation via defect correction

Summary For the numerical integration of boundary value problems for first order ordinary differential systems, collocation on Gaussian points is known to provide a powerful method. In this paper we introduce a defect correction method for the iterative solution of such high order collocation equations. The method uses the trapezoidal scheme as the basic discretization and an adapted form of the collocation equations for defect evaluation. The error analysis is based on estimates of the contractive power of the defect correction iteration. It is shown that the iteration producesO(h ²), convergence rates for smooth starting vectors. A new result is that the iteration damps all kind of errors, so that it can also handle non-smooth starting vectors successfully.     

On symmetrizers for Gauss methods

Summary In this paper the maximum attainable order of a special class of symmetrizers for Gauss methods is studied. In particular, it is shown that a symmetrizer of this type for thes-stage Gauss method can attain order 2s-1 only for 1 s 3, and that these symmetrizers areL-stable. A classification of the maximum attainable order of symmetrizers for some higher stages is presented. AnL-stable symmetrizer is also shown to exist for each of the methods studied.     

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- 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     

Produktintegration mit nicht-äquidistanten Stützstellen

Summary For the numerical evaluation of , 0<<1 andx smooth, product integration rules are applied. It is known that high-order rules, e.g. Gauss-Legendre quadrature, become normal-order rules in this case. In this paper it is shown that the high order is preserved by a nonequidistant spacing. Furthermore, the leading error terms of this product integration method and numerical examples are given.

     

Two-step fourth orderP-stable methods for second order differential equations

A family of two-step fourth order methods, which requires two function evaluations per step, is derived fory=f(x,y). We then show the existence of a sub-family of these methods which when applied toy=–k ² y,k real, areP-stable.