Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Runge–Kutta methods
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Family of implicit and explicit iterative methods}} [[File:Comparison of the Runge-Kutta methods for the differential equation (red is the exact solution).svg|thumb|upright=1.25|Comparison of the Runge-Kutta methods for the differential equation <math>y'=\sin(t)^2 \cdot y</math> (red is the exact solution)]] {{Differential equations}} In [[numerical analysis]], the '''Runge–Kutta methods''' ({{IPAc-en|lang|ˈ|r|ʊ|ŋ|ə|ˈ|k|ʊ|t|ɑː|audio=en-us-Runge-Kutta.ogg}} {{Respell|RUUNG|ə|KUUT|tah}}<ref>{{cite web |title=Runge-Kutta method |url=https://www.dictionary.com/browse/runge-kutta-method |website=[[Dictionary.com]] |access-date=4 April 2021 |language=en}}</ref>) are a family of [[Explicit and implicit methods|implicit and explicit]] iterative methods, which include the [[Euler method]], used in [[temporal discretization]] for the approximate solutions of [[simultaneous nonlinear equations]].<ref>DEVRIES, Paul L.; HASBUN, Javier E. A first course in computational physics. Second edition. Jones and Bartlett Publishers: 2011. p. 215.</ref> These methods were developed around 1900 by the German mathematicians [[Carl Runge]] and [[Wilhelm Kutta]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)