Numerical Advancements: A Duel between Euler-Maclaurin and Runge-Kutta for Initial Value Problem

This work is dedicated to advancing the approximation of initial value problems through the introduction of an innovative and superior method inspired by the Euler-Maclaurin formula. This results in a higher-order implicit corrected method that outperforms the Runge-Kutta method in terms of accuracy. We derive an error bound for the Euler-Maclaurin higher-order method, showcasing its stability, convergence, and greater efficiency compared to the conventional Runge-Kutta method. To substantiate our claims, numerical experiments are provided, highlighting the exceptional efficiency of our proposed method over the traditional well-known methods. In conclusion, the proposed method consistently outperforms the Runge-Kutta method experimentally in all practical problems.