To approximate the solution of the initial-value problem
y' = f (t, y), a < t < b, y (a) =a, at (N + 1) equally spaced numbers in the interval (a, b]: IN PUT endpoints a, b; integer N initial condition a. OUTPUT approximation w toy at the (N + 1) values oft . 5.4 Runge-Kutta Methods 289 Step 1 Seth= (b - a)/N; t = a; w =a; OUTPUT (t, w). Step 2 For i = l, 2, ... , N do Steps 3-5. Step 3 Set K1 = hf (t, w); K2 = hf (t + h/2, w + Ki/2); = hf (t + h/2, w + K2/2); K3 = hf (t + h, w + K3). K4 Step 4 Set w = w + (K1 + 2K2 + 2K3 + K4)/6; (Compute wi.) t =a+ ih. (Compute ti.) Step 5 OUTPUT (t, w). I Step 6 STOP.
Ten-Decimal Tables of the Logarithms of Complex Numbers and for the Transformation from Cartesian to Polar Coordinates: Volume 33 in Mathematical Tables Series