Basic HTML version of Foils prepared 14 October 1997

Foil 19 The Classical Runge-Kutta -- In Words

From Fox Presentation Fall 1995 CPS615 Basic Simulation Track for Computational Science -- Fall Semester 95/96/97. by Nancy McCracken and Geoffrey C. Fox


1 Runge Kutta methods achieve better results than Euler by using intermediate computations at intermediate time values
2 The fourth-order rule is the favorite method as it achieves good accuracy with modest computational complexity -- the algorithm is in words:
3 Use derivative of first time step to get trial midpoint
4 Use its derivative at first time step to get second trial midpoint
5 Use its derivative to get a trial end point
6 Integrate by Simpon's Rule, using average of two midpoint estimates
7 Global error is fourth order

in Table To:


© Northeast Parallel Architectures Center, Syracuse University, npac@npac.syr.edu

If you have any comments about this server, send e-mail to webmaster@npac.syr.edu.

Page produced by wwwfoil on Fri Oct 2 1998