![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/b/b1/Comparison_of_the_Runge-Kutta_methods_for_the_differential_equation_%2528red_is_the_exact_solution%2529.svg/640px-Comparison_of_the_Runge-Kutta_methods_for_the_differential_equation_%2528red_is_the_exact_solution%2529.svg.png&w=640&q=50)
Runge–Kutta methods
Family of implicit and explicit iterative methods / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Runge–Kutta methods?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In numerical analysis, the Runge–Kutta methods (English: /ˈrʊŋəˈkʊtɑː/ ⓘ RUUNG-ə-KUUT-tah[1]) are a family of implicit and explicit iterative methods, which include the Euler method, used in temporal discretization for the approximate solutions of simultaneous nonlinear equations.[2] These methods were developed around 1900 by the German mathematicians Carl Runge and Wilhelm Kutta.
![](http://upload.wikimedia.org/wikipedia/commons/thumb/b/b1/Comparison_of_the_Runge-Kutta_methods_for_the_differential_equation_%28red_is_the_exact_solution%29.svg/640px-Comparison_of_the_Runge-Kutta_methods_for_the_differential_equation_%28red_is_the_exact_solution%29.svg.png)