The Runge Kutta methods provide further systematic improvement in the spirit of the modified Euler method. Because of their simplicity and accuracy, they are some of the most popular methods for integrating ordinary differential equations.
For example, the fourth order Runge Kutta method does four function
evaluations per step to give a method with fourth order accuracy. We
state the stepping method without proof:
![]() |
![]() |
![]() |
|
![]() |
![]() |
![]() |
|
![]() |
![]() |
![]() |
(7) |
![]() |
![]() |
![]() |
(8) |
![]() |
![]() |
![]() |
Notice that the first two steps look like the modified Euler method
for reaching the midpoint . We leave as an exercise
for the student to rewrite the modified Euler method in the
notation above. Of course
in that case has to be evaluated at
.
There are many Runge Kutta methods of different order. The second
order Runge Kutta method is also called the midpoint method and
goes like this:
![]() |
![]() |
![]() |
|
![]() |
![]() |
![]() |
(9) |
![]() |
![]() |
![]() |
Probably because for many problems it gives a good compromise between the limitations of complexity, which argue for not going to too high order, and the benefits of accuracy, which argue for higher order, the fourth order method is especially popular.