Time Steps Distribution in Numerical Technique: A Comparative Analysis of Third and Fourth Order Runge-kutta Algorithms

Abstract

To analyze a harmonically Van der Pol oscillator, this work used a combination of graphs, time steps distribution, adaptive time steps Runge-Kutta, and fourth order algorithms. The goal is to examine the performance of third and fourth order Runge-Kutta algorithms in finding chaotic solutions for a harmonically excited Van der Pol oscillator. Fourth-order algorithms favor larger time steps and are thus faster to execute than third-order algorithms in all circumstances studied. The accuracy of the data acquired with third order is worth the longer overall computation time steps period reported