Aug 2026· AIP Advances· Vol 16· 0 citations· 19 references
TL;DR
The importance of the numerical solver used to generate the Lorenz dataset is emphasized and a Valid Ground Truth Time (VGTT) during which the outputs of several common solvers agree is defined, as a VPT exceeding the VGTT is not meaningful, as a different solver could produce a different result.
Abstract
We study the impact of the regularization coefficient λ on Reservoir Computer (RC) performance for chaotic time series prediction of the Lorenz system. We find that a larger λ results in a larger error of the first prediction step of the RC. The RC error initially evolves according to a rapid, nonautonomous expansion at very early times followed by the expected exponential, Lyapunov growth of the error. The maximum Lyapunov exponent of the prediction is close to the maximum Lyapunov exponent of the Lorenz system regardless of λ, whereas the error of the first prediction step and the rate of the nonautonomous growth are λ-dependent and are responsible for the λ dependence of the Valid Prediction Time (VPT) of the RC. Interestingly, we find that the VPT can exceed 30 Lyapunov times for vanishingly small λ, as we are predicting a noiseless system with a small sampling step and spectral radius. Moreover, we emphasize the importance of the numerical solver used to generate the Lorenz dataset and define a Valid Ground Truth Time (VGTT) during which the outputs of several common solvers agree. A VPT exceeding the VGTT is not meaningful, as a different solver could produce a different result.
This paper presents a mathematical method for predicting the states of chaotic dynamic systems, taking into account local non-linearity, the spectral properties of the transition operator, and the limited predictability of chaotic processes. The relevance of the research stems from the high sensitivity of chaotic syste...
O. Nechyporuk, Н. В. Апенько, O. Buzun et al.· Mechanics And Mathematical M...· 0 citations
The study of evolution in temporally fluctuating environments often relies on the analysis of Lyapunov exponents, which quantify the exponential growth of populations. However, when model parameters depend on a stochastic process, calculating the selection gradient, a key tool for predicting the evolution of phenotypic...
Largest Lyapunov exponents (LLEs) quantify exponential sensitivity, but data-driven estimates are often obtained from finite-precision trajectories. We show that increasing the length of a single reduced-precision chaotic record can eventually degrade a forecast-error LLE estimate. Using the logistic map at r=4, an ESP...
The sensitivity of chaotic dynamical systems to the initial conditions makes the long-term numerical simulations of such systems challenging since the discretization error can either dampen true chaos or produce artificial chaos. In this paper, we examine the capability of the conventional, advanced, and trigonometric...
Abdulsattar Abdullah Hamad· Frontiers in Applied Mathema...· 0 citations
The analysis of the complexity of dynamical systems generally presents a major dilemma between including the complexity of memory effects and being computationally efficient. For this purpose, this study proposes an unusual three-dimensional variable-order fractional chaotic system with absolute-value nonlinearity, whi...
Abdulrahman B. M. Alzahrani, Mohamed A. Abdoon· Fractal and Fractional· 0 citations
We investigate the discrete-time version of the Kuramoto model with phase lag, which comprises globally-coupled phase oscillators of distributed frequencies that are evolving under a nonlinear map. In the continuum limit of an infinite number of oscillators ($N\to \infty$), we derive the exact Frobenius-Perron equation...
Prashant M. Gade, Shamik Gupta· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.