IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v428y2022ics0096300322002818.html
   My bibliography  Save this article

Effective computational discretization scheme for nonlinear dynamical systems

Author

Listed:
  • Guedes, Priscila F.S.
  • Mendes, Eduardo M.A.M.
  • Nepomuceno, Erivelton

Abstract

Numerical methods are essential to investigate and apply nonlinear continuous-time dynamical systems in many fields of science and engineering and discretization schemes are required to obtain the solutions of such dynamical systems. Although computing power has been speedily growing in recent decades, embedded and large-scale problems have motivated significant research to improve the computational efficiency. Nevertheless, few studies have focused on finite precision limitation on discretization schemes due to round-off effects in floating-point number representation. In this paper, a computational effective discretization scheme for nonlinear dynamical systems is introduced. By means of a theorem, it is shown that high-order terms in the Runge-Kutta method can be neglected with no accuracy loss. The proposed approach is illustrated using three well-known systems, namely the Rössler systems, the Lorenz equations and the Sprott B system. The number of mathematical operations and simulation time have reduced up to 81.1% and 90.7%, respectively. Furthermore, as the step-size decreases, the number of neglected terms increases due to the precision of the computer. Yet, accuracy, observability of dynamical systems and the largest Lyapunov are preserved. The adapted scheme is effective, reliable and suitable for embedded and large-scale applications.

Suggested Citation

  • Guedes, Priscila F.S. & Mendes, Eduardo M.A.M. & Nepomuceno, Erivelton, 2022. "Effective computational discretization scheme for nonlinear dynamical systems," Applied Mathematics and Computation, Elsevier, vol. 428(C).
    • Handle: RePEc:eee:apmaco:v:428:y:2022:i:c:s0096300322002818
    DOI: 10.1016/j.amc.2022.127207
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300322002818
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.127207?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Moreira Bezerra, João Inácio & Valduga de Almeida Camargo, Vinícius & Molter, Alexandre, 2021. "A new efficient permutation-diffusion encryption algorithm based on a chaotic map," Chaos, Solitons & Fractals, Elsevier, vol. 151(C).
    2. Nepomuceno, Erivelton G. & Martins, Samir A.M. & Silva, Bruno C. & Amaral, Gleison F.V. & Perc, Matjaž, 2018. "Detecting unreliable computer simulations of recursive functions with interval extensions," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 408-419.
    3. Liu, Bo & Wang, Ling & Jin, Yi-Hui & Tang, Fang & Huang, De-Xian, 2005. "Improved particle swarm optimization combined with chaos," Chaos, Solitons & Fractals, Elsevier, vol. 25(5), pages 1261-1271.
    4. Nepomuceno, Erivelton Geraldo & Mendes, Eduardo M.A.M., 2017. "On the analysis of pseudo-orbits of continuous chaotic nonlinear systems simulated using discretization schemes in a digital computer," Chaos, Solitons & Fractals, Elsevier, vol. 95(C), pages 21-32.
    5. Lai, Qiang & Xu, Guanghui & Pei, Huiqin, 2019. "Analysis and control of multiple attractors in Sprott B system," Chaos, Solitons & Fractals, Elsevier, vol. 123(C), pages 192-200.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nardo, Lucas G. & Nepomuceno, Erivelton G. & Arias-Garcia, Janier & Butusov, Denis N., 2019. "Image encryption using finite-precision error," Chaos, Solitons & Fractals, Elsevier, vol. 123(C), pages 69-78.
    2. Zhang, Xiaofang & Li, Hongqing & Jiang, Wenan & Chen, Liqun & Bi, Qinsheng, 2022. "Exploiting multiple-frequency bursting of a shape memory oscillator," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    3. Ivona Brajević & Jelena Ignjatović, 2019. "An upgraded firefly algorithm with feasibility-based rules for constrained engineering optimization problems," Journal of Intelligent Manufacturing, Springer, vol. 30(6), pages 2545-2574, August.
    4. Yu, Haiquan & Zhou, Jianxin & Si, Fengqi & Nord, Lars O., 2022. "Combined heat and power dynamic economic dispatch considering field operational characteristics of natural gas combined cycle plants," Energy, Elsevier, vol. 244(PA).
    5. Wang, Jianzhou & Qin, Shanshan & Jin, Shiqiang & Wu, Jie, 2015. "Estimation methods review and analysis of offshore extreme wind speeds and wind energy resources," Renewable and Sustainable Energy Reviews, Elsevier, vol. 42(C), pages 26-42.
    6. Xuanhu He & Wei Wang & Jiuchun Jiang & Lijie Xu, 2015. "An Improved Artificial Bee Colony Algorithm and Its Application to Multi-Objective Optimal Power Flow," Energies, MDPI, vol. 8(4), pages 1-26, March.
    7. Nepomuceno, Erivelton G. & Rodrigues Junior, Heitor M. & Martins, Samir A.M. & Perc, Matjaž & Slavinec, Mitja, 2018. "Interval computing periodic orbits of maps using a piecewise approach," Applied Mathematics and Computation, Elsevier, vol. 336(C), pages 67-75.
    8. Ding, Dawei & Wang, Wei & Yang, Zongli & Hu, Yongbing & Wang, Jin & Wang, Mouyuan & Niu, Yan & Zhu, Haifei, 2023. "An n-dimensional modulo chaotic system with expected Lyapunov exponents and its application in image encryption," Chaos, Solitons & Fractals, Elsevier, vol. 174(C).
    9. Amaral, Gleison F.V. & Nepomuceno, Erivelton G., 2018. "A smooth-piecewise model to the Cord Attractor," Chaos, Solitons & Fractals, Elsevier, vol. 109(C), pages 31-35.
    10. El-Shorbagy, M.A. & Mousa, A.A. & Nasr, S.M., 2016. "A chaos-based evolutionary algorithm for general nonlinear programming problems," Chaos, Solitons & Fractals, Elsevier, vol. 85(C), pages 8-21.
    11. Hossein Lotfi, 2022. "A Multiobjective Evolutionary Approach for Solving the Multi-Area Dynamic Economic Emission Dispatch Problem Considering Reliability Concerns," Sustainability, MDPI, vol. 15(1), pages 1-23, December.
    12. Bezerra, João Inácio Moreira & Machado, Gustavo & Molter, Alexandre & Soares, Rafael Iankowski & Camargo, Vinícius, 2023. "A novel simultaneous permutation–diffusion image encryption scheme based on a discrete space map," Chaos, Solitons & Fractals, Elsevier, vol. 168(C).
    13. Zhang, Wen Yu & Hong, Wei-Chiang & Dong, Yucheng & Tsai, Gary & Sung, Jing-Tian & Fan, Guo-feng, 2012. "Application of SVR with chaotic GASA algorithm in cyclic electric load forecasting," Energy, Elsevier, vol. 45(1), pages 850-858.
    14. He, Qie & Wang, Ling & Liu, Bo, 2007. "Parameter estimation for chaotic systems by particle swarm optimization," Chaos, Solitons & Fractals, Elsevier, vol. 34(2), pages 654-661.
    15. Adel Taieb & Moêz Soltani & Abdelkader Chaari, 2017. "Parameter Optimization of MIMO Fuzzy Optimal Model Predictive Control By APSO," Complexity, Hindawi, vol. 2017, pages 1-11, October.
    16. Ren, Weikai & Jin, Zhijun, 2023. "Phase space visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    17. Yang, Dixiong & Li, Gang & Cheng, Gengdong, 2007. "On the efficiency of chaos optimization algorithms for global optimization," Chaos, Solitons & Fractals, Elsevier, vol. 34(4), pages 1366-1375.
    18. dos Santos Coelho, Leandro & Coelho, Antonio Augusto Rodrigues, 2009. "Model-free adaptive control optimization using a chaotic particle swarm approach," Chaos, Solitons & Fractals, Elsevier, vol. 41(4), pages 2001-2009.
    19. Mohamad Javad Alizadeh & Davoud Ahmadyar & Ali Afghantoloee, 2017. "Improvement on the Existing Equations for Predicting Longitudinal Dispersion Coefficient," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 31(6), pages 1777-1794, April.
    20. Nepomuceno, Erivelton G. & Martins, Samir A.M. & Silva, Bruno C. & Amaral, Gleison F.V. & Perc, Matjaž, 2018. "Detecting unreliable computer simulations of recursive functions with interval extensions," Applied Mathematics and Computation, Elsevier, vol. 329(C), pages 408-419.

    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:eee:apmaco:v:428:y:2022:i:c:s0096300322002818. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.