# Package com.numericalmethod.suanshu.analysis.differentialequation.ode.ivp.solver.rungekutta

• Interface Summary
Interface Description
RungeKuttaStepper
• Class Summary
Class Description
RungeKutta
The Runge-Kutta methods are an important family of implicit and explicit iterative methods for the approximation of solutions of ordinary differential equations.
RungeKutta1
This is the first-order Runge-Kutta formula, which is the same as the Euler method.
RungeKutta10
This is the tenth-order Runge-Kutta formula.
RungeKutta2
This is the second-order Runge-Kutta formula, which can be implemented efficiently with a three-step algorithm.
RungeKutta3
This is the third-order Runge-Kutta formula.
RungeKutta4
This is the fourth-order Runge-Kutta formula.
RungeKutta5
This is the fifth-order Runge-Kutta formula.
RungeKutta6
This is the sixth-order Runge-Kutta formula.
RungeKutta7
This is the seventh-order Runge-Kutta formula.
RungeKutta8
This is the eighth-order Runge-Kutta formula.
RungeKuttaFehlberg
The Runge-Kutta-Fehlberg method is a version of the classic Runge-Kutta method, which additionally uses step-size control and hence allows specification of a local truncation error bound.
RungeKuttaIntegrator
This integrator works with a single-step stepper which estimates the solution for the next step given the solution of the current step.