Hacker News new | ask | show | jobs
by ben165 2513 days ago
It's the easiest approach to solve the ODL: Euler Forward (yes, first order). The approximation could be much better and almost exact with a smaller step size. Runge-Kutta is used for higher ODL's, where the Euler method would fail (especially with periodic solutions).