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

Interval computing periodic orbits of maps using a piecewise approach

Author

Listed:
  • Nepomuceno, Erivelton G.
  • Rodrigues Junior, Heitor M.
  • Martins, Samir A.M.
  • Perc, Matjaž
  • Slavinec, Mitja

Abstract

Interval arithmetic applied to simulation of dynamical systems has attracted a great deal of interest in recent years. Much of this research has been carried out in the calculation of fixed points or low-period windows for nonlinear discrete maps. This study proposes a novel interval computation based on a piecewise method to calculate periodic orbits for the logistic map. Using the cobweb plot, three rounding situations have been applied to a correct outward rounding, as required by interval arithmetic. The proposed method is compared with results in the literature and with the results obtained by means of the Matlab toolbox Intlab. The comparison is accomplished for nine case studies using the logistic map. Numerical results explicitly indicate that the proposed method produces intervals that are substantially narrower than those obtained with the traditional techniques.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:336:y:2018:i:c:p:67-75
    DOI: 10.1016/j.amc.2018.04.063
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318303898
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.04.063?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 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.
    2. Spandl, Christoph, 2012. "Computational complexity of iterated maps on the interval," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 82(8), pages 1459-1477.
    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. 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).
    2. Aleksandra Tutueva & Timur Karimov & Denis Butusov, 2020. "Semi-Implicit and Semi-Explicit Adams-Bashforth-Moulton Methods," Mathematics, MDPI, vol. 8(5), pages 1-10, May.

    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. 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).

    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:336:y:2018:i:c:p:67-75. 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.