Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1602.05410

The Lyapunov dimension and its estimation via the Leonov method

N. V. Kuznetsov
View original source ↗Read source document ↗Export metadata ↓

Abstract

Along with widely used numerical methods for estimating and computing the Lyapunov dimension there is an effective analytical approach, proposed by G.A. Leonov in 1991. The Leonov method is based on the direct Lyapunov method with special Lyapunov-like functions. The advantage of this method is that it allows one to estimate the Lyapunov dimension of invariant set without local- ization of the set in the phase space and in many cases get effectively exact Lyapunov dimension formula. In this survey the invariance of Lyapunov dimension with respect to diffeomorphisms and its connection with the Leonov method are discussed. An analog of Leonov method for discrete time dynamical systems is suggested. In a simple but rigorous way, here it is presented the connection between the Leonov method and the key related works in the area: by Kaplan and Yorke (the concept of Lyapunov dimension, 1979), Douady and Oesterle (upper bounds of Hausdorff dimension via the Lyapunov dimension of maps, 1980), Constantin, Eden, Foias, and Temam (upper bounds of Hausdorff dimension via the Lyapunov exponents and dimension of dynamical systems, 1985-90), and the numerical calculation of the Lyapunov exponents and dimension.

Explore related subjects

nlin.CD

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

N. V. Kuznetsov. 2016-11-26. The Lyapunov dimension and its estimation via the Leonov method. https://doi.org/10.1016/j.physleta.2016.04.036

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD↗
arXiv2026

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD↗
arXiv2026

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD↗