c - SCI Utah
Applied Numerical Mathematics 2 (1986) 109-l 18 North-Holland
A C’ INTERPOLANT FORMULAE
109
FOR CODES BASED ON BACKWARD DIFFERENTIATION
M. BERZINS Department of Computer Studies, University of Leeds, Leeds LS2 9Jr
U.K.
This note is concerned with the provision of an interpolant for o.d.e. initial value codes based upon backward differentiation formulae (b.d.f.) in which both the solution and its first time derivative are continuous over the range of integrationa C’ interpolant. The construction and implementation of the interpolant is described and the continuity achieved in practice is illustrated by two exampfec.
1. Introduction At present many of the most popular library programs for the solution of the stiff initial value problem y’W =f(t,
y(t)).
y(a)
given,
a
A C’ INTERPOLANT FORMULAE
109
FOR CODES BASED ON BACKWARD DIFFERENTIATION
M. BERZINS Department of Computer Studies, University of Leeds, Leeds LS2 9Jr
U.K.
This note is concerned with the provision of an interpolant for o.d.e. initial value codes based upon backward differentiation formulae (b.d.f.) in which both the solution and its first time derivative are continuous over the range of integrationa C’ interpolant. The construction and implementation of the interpolant is described and the continuity achieved in practice is illustrated by two exampfec.
1. Introduction At present many of the most popular library programs for the solution of the stiff initial value problem y’W =f(t,
y(t)).
y(a)
given,
a
