In numerical analysis, the Runge–Kutta methods are an important family of implicit and explicit iterative methods, which are used in temporal discretization for the approximation of solutions of ordinary differential equations. These techniques were developed around 1900 by the German mathematicians C. Runge and M. W. Kutta.See the article on numerical methods for ordinary differential equations for more background and other methods. See also List of Runge–Kutta methods.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| is known for of |