On the use of interval extensions to estimate the largest Lyapunov exponent from chaotic data (Q1721305): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A practical method for calculating largest Lyapunov exponents from small data sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyapunov characteristic exponents for smooth dynamical systems and for Hamiltonian systems; a method for computing all of them. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Lyapunov exponents from a time series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of Different Methods for Computing Lyapunov Exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: High precision numerical estimation of the largest Lyapunov exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local echo state property through the largest Lyapunov exponent / rank
 
Normal rank
Property / cites work
 
Property / cites work: A step-size selection strategy for explicit Runge-Kutta methods based on Lyapunov exponent theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Very Simple Method to Calculate the (Positive) Largest Lyapunov Exponent Using Interval Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear System Identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling nonlinear dynamics and chaos: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: RETRIEVING DYNAMICAL INVARIANTS FROM CHAOTIC DATA USING NARMAX MODELS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations of non-linear systems: the NARMAX model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An identification algorithm for polynomial NARX models based on simulation error minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Identifying Global Nonlinear Discrete Models from Chaotic Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Identification and Cluster Analysis of Chaotic Attractors from a Real Implementation of Chua's Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Topology of Chaos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Computing with IEEE Floating Point Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of pseudo-orbits of continuous chaotic nonlinear systems simulated using discretization schemes in a digital computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONLINEAR IDENTIFICATION USING PRIOR KNOWLEDGE OF FIXED POINTS: A MULTIOBJECTIVE APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equation for continuous chaos / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oscillation and Chaos in Physiological Control Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chaotic attractors of an infinite-dimensional dynamical system / rank
 
Normal rank

Latest revision as of 03:19, 18 July 2024

scientific article
Language Label Description Also known as
English
On the use of interval extensions to estimate the largest Lyapunov exponent from chaotic data
scientific article

    Statements

    On the use of interval extensions to estimate the largest Lyapunov exponent from chaotic data (English)
    0 references
    8 February 2019
    0 references
    Summary: 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.
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references