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

Detecting unreliable computer simulations of recursive functions with interval extensions

Author

Listed:
  • Nepomuceno, Erivelton G.
  • Martins, Samir A.M.
  • Silva, Bruno C.
  • Amaral, Gleison F.V.
  • Perc, Matjaž

Abstract

This paper presents a procedure to detect unreliable computer simulations of recursive functions. The proposed method calculates a lower bound error which is derived from two different pseudo-orbits based on interval extensions. The interval extensions are generated by taking into account the associative property of multiplication, which keeps the same error bound. We have tested our approach on the logistic map using many different programming languages and simulation packages, including Matlab, Scilab, Octave, Fortran and C. In all cases, the number of iterates is significantly lower than that considered reliable in the existing literature. We have also used the lower bound error on the logistic map and on the polynomial NARMAX for the Rössler equations to estimate the largest Lyapunov exponent, which determines the critical simulation time that guarantees the reliability of the simulation.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:329:y:2018:i:c:p:408-419
    DOI: 10.1016/j.amc.2018.02.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630031830122X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.02.020?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. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mehmood, Ammara & Raja, Muhammad Asif Zahoor & Ninness, Brett, 2024. "Design of fractional-order hammerstein control auto-regressive model for heat exchanger system identification: Treatise on fuzzy-evolutionary computing," Chaos, Solitons & Fractals, Elsevier, vol. 181(C).
    2. 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.
    3. 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.
    4. 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).

    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. 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.
    2. Ren, Weikai & Jin, Zhijun, 2023. "Phase space visibility graph," Chaos, Solitons & Fractals, Elsevier, vol. 176(C).
    3. Peixoto, Márcia L.C. & Nepomuceno, Erivelton G. & Martins, Samir A.M. & Lacerda, Márcio J., 2018. "Computation of the largest positive Lyapunov exponent using rounding mode and recursive least square algorithm," Chaos, Solitons & Fractals, Elsevier, vol. 112(C), pages 36-43.
    4. 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.
    5. Nazarimehr, Fahimeh & Rajagopal, Karthikeyan & Khalaf, Abdul Jalil M. & Alsaedi, Ahmed & Pham, Viet-Thanh & Hayat, Tasawar, 2018. "Investigation of dynamical properties in a chaotic flow with one unstable equilibrium: Circuit design and entropy analysis," Chaos, Solitons & Fractals, Elsevier, vol. 115(C), pages 7-13.
    6. 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).
    7. 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).
    8. Tutueva, Aleksandra V. & Nepomuceno, Erivelton G. & Karimov, Artur I. & Andreev, Valery S. & Butusov, Denis N., 2020. "Adaptive chaotic maps and their application to pseudo-random numbers generation," Chaos, Solitons & Fractals, Elsevier, vol. 133(C).
    9. De Micco, L. & Antonelli, M. & Larrondo, H.A., 2017. "Stochastic degradation of the fixed-point version of 2D-chaotic maps," Chaos, Solitons & Fractals, Elsevier, vol. 104(C), pages 477-484.

    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:329:y:2018:i:c:p:408-419. 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.