IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v30y2025i4p470-500.html
   My bibliography  Save this article

Optimised variable step-size algorithm for the solution of dynamical systems

Author

Listed:
  • Joshua Sunday
  • Richard Olatokunbo Akinola
  • Joshua Amawa Kwanamu
  • Dominic Raymond

Abstract

This study focuses on the formulation of optimised variable step-size algorithm (OVSSA) for the solution of dynamical systems. In order to minimise the number of iterations and number of steps taken as well as improve the accuracy of the proposed algorithm, an embedded strategy was deployed in formulating the method using variable stepsize mode. One of the major advantages of the proposed OVSSA is that the algorithm automatically fine-tunes (or adjusts) the stepsize to suit the problem under consideration according to the variable stepsize strategy defined by the authors. Convergence properties of the OVSSA were also analysed theoretically in order to validate its stability and computational reliability. The OVSSA was employed in solving dynamical systems like the Van der Pol, Genesio-Tesi, Kepler and Lorenz systems. The results generated as a result of the application of the OVSSA on dynamical systems clearly showed that the method is convergent and computationally reliable.

Suggested Citation

  • Joshua Sunday & Richard Olatokunbo Akinola & Joshua Amawa Kwanamu & Dominic Raymond, 2025. "Optimised variable step-size algorithm for the solution of dynamical systems," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 30(4), pages 470-500.
    • Handle: RePEc:ids:ijmore:v:30:y:2025:i:4:p:470-500
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=146357
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:30:y:2025:i:4:p:470-500. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.