IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6909151.html
   My bibliography  Save this article

On the Use of Interval Extensions to Estimate the Largest Lyapunov Exponent from Chaotic Data

Author

Listed:
  • Erivelton G. Nepomuceno
  • Samir A. M. Martins
  • Márcio J. Lacerda
  • Eduardo M. A. M. Mendes

Abstract

A method to estimate the (positive) largest Lyapunov exponent (LLE) from data using interval extensions is proposed. The method differs from the ones available in the literature in its simplicity since it is only based on three rather simple steps. Firstly, a polynomial NARMAX is used to identify a model from the data under investigation. Secondly, interval extensions, which can be easily extracted from the identified model, are used to calculate the lower bound error. Finally, a simple linear fit to the logarithm of lower bound error is obtained and then the LLE is retrieved from it as the third step. To illustrate the proposed method, the LLE is calculated for the following well-known benchmarks: sine map, Rössler Equations, and Mackey-Glass Equations from identified models given in the literature and also from two identified NARMAX models: a chaotic jerk circuit and the tent map. In the latter, a Gaussian noise has been added to show the robustness of the proposed method.

Suggested Citation

  • Erivelton G. Nepomuceno & Samir A. M. Martins & Márcio J. Lacerda & Eduardo M. A. M. Mendes, 2018. "On the Use of Interval Extensions to Estimate the Largest Lyapunov Exponent from Chaotic Data," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-8, March.
    • Handle: RePEc:hin:jnlmpe:6909151
    DOI: 10.1155/2018/6909151
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/6909151.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2018/6909151.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/6909151?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
    ---><---

    Citations

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


    Cited by:

    1. Zhou, Shuang & Wang, Xingyuan, 2020. "Simple estimation method for the second-largest Lyapunov exponent of chaotic differential equations," Chaos, Solitons & Fractals, Elsevier, vol. 139(C).
    2. Osrajnik, Damjan & Grubelnik, Vladimir & Repnik, Robert, 2021. "Multirhythmicity but no deterministic chaos in vibrating strings," Chaos, Solitons & Fractals, Elsevier, vol. 150(C).

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6909151. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.