68
2. Basic Finite-Difference Methods
Method
Forward
Backward
Asselin
Leapfrog
Leapfrog
AdarnsBashforth
Trapezoidal
Runge-Kutta
Magazenkov
LeapfrogTrapezoidal
AdarnsBashforth
AdamsMouIton
ABM PredictorCorrector
Order
2
2
2
2
2
2
3
3
3
Formula

2
2
ql = hF( n) .
q2 = hF( 1 =

1 =

1 =

n- I)]

2
Runge-Kutta
3
ql = hF(

q2 = hF( q3 = hF(I/J2) - IS3q2/J2S,

Runge-Kutta
4
ql = hF(

q3 = hF(

q2 = hF(

q4 = hF(

second- and third-order Runge-Kutta methods are low-storage variants; h = /),1.