Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site utcsri.UUCP
Path: utzoo!utcsri!voula
From: voula@utcsri.UUCP (Voula Vanneli)
Newsgroups: ont.events
Subject: Numerical Analysis Seminar
Message-ID: <789@utcsri.UUCP>
Date: Wed, 20-Feb-85 15:05:22 EST
Article-I.D.: utcsri.789
Posted: Wed Feb 20 15:05:22 1985
Date-Received: Wed, 20-Feb-85 18:45:16 EST
Distribution: ont
Organization: CSRI, University of Toronto
Lines: 30


                   University of Toronto
               Department of Computer Science
  (SF = Sandford Fleming Building, 10 King's College Road)


NUMERICAL ANALYSIS SEMINAR  -  Thursday,  February  28th,  3
p.m., SF 1105

                 Professor Kenneth Jackson
      Dept. of Computer Science, University of Toronto

            "Runge-Kutta Methods for the 1990's"

                          Abstract

Since the development of DVERK by Hull, Enright and  Jackson
in the 1970's, there has been a number of advances in formu-
las and heuristics for Runge-Kutta methods.  We shall review
some  of  these  advances  in general and the development of
interpolants for Runge-Kutta methods in particular.

More specifically, we shall discuss a general procedure  for
the  construction  of  interpolants for Runge-Kutta methods.
As illustrations, we shall use  this  procedure  to  develop
interpolants   for   three  explicit  Runge-Kutta  formulas,
including those employed in the well-known subroutines RKF45
and DVERK.  A typical result is that only one extra function
evaluation per step is required to obtain a  locally  sixth-
order interpolant for DVERK.