Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Runge–Kutta methods
open-in-new
<p>In <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a>, the Runge–Kutta methods (English: /ˈrʊŋəˈkʊtɑː/ ⓘ RUUNG-ə-KUUT-tah) are a family of <a href="/facts/Explicit_and_implicit_methods/jnJhWfuh">implicit and explicit</a> iterative methods, which include the <a href="/facts/Euler_method/7yF5B4z9">Euler method</a>, used in <a href="/facts/Temporal_discretization/nXPjUf10">temporal discretization</a> for the approximate solutions of <a href="/facts/Simultaneous_nonlinear_equations/4aYItALC">simultaneous nonlinear equations</a>. These methods were developed around 1900 by the German mathematicians <a href="/facts/Carl_Runge/XErAYMT8">Carl Runge</a> and <a href="/facts/Wilhelm_Kutta/VwJXlfUJ">Wilhelm Kutta</a>. </p>