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
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
