Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Runge-Kutta Method Algorithm

Numerical Algorithm

The Runge-Kutta methods are a family of techniques for numerically solving ordinary differential equations by estimating the solution's value at successive steps forward in time, using a weighted combination of several trial slope estimates computed within each step rather than a single slope estimate as in the simpler Euler method. The most commonly used member of the family, often called simply the Runge-Kutta method or RK4, evaluates four such slope estimates per step and achieves fourth-order accuracy. The methods are named for the German mathematicians Carl Runge and Wilhelm Kutta, who developed them around 1900.

Facts
Credited To
Carl Runge and Wilhelm Kutta 1
Connections

In Field

Source Wikipedia: Runge-Kutta methods
Sources
1. Wikipedia: Runge-Kutta methods
  • Article body, sentence crediting Runge and Kutta
    developed around 1900 by the German mathematicians Carl Runge and Wilhelm Kutta
  • In Field: Computational Science, Lead section
    In numerical analysis, the Runge-Kutta methods (English: RUUNG-ə-KUUT-tah) are a family of explicit and implicit iterative methods, which include the Euler method, used in discretization for the approximate solutions of differential equations.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.