Search arXivSearch

arXiv · 2605.03587

Gr\"unwald--Letnikov Memory Truncation in a Fractional Duffing Oscillator: Coherence Loss and Effective Delay Complexity

Abstract

We investigate the dynamical and analytical consequences of truncating the Gr\"unwald--Letnikov memory term in a fractional Duffing oscillator. The truncated memory is treated not merely as a computational approximation, but as a finite-memory modification of the underlying dynamical system. We define a coherence-loss time from direct comparisons between the full-history discrete GL reference and its truncated-memory counterpart, and use it to extract critical memory horizons in parameter planes involving the forcing amplitude and the fractional order. The results reveal strongly non-monotonic critical memory horizons, showing that the retained memory required to preserve coherence depends on the forcing regime, the fractional order, and the nonlinear sensitivity of the dynamics. We also derive a local characteristic equation for the truncated GL kernel and show that it admits a local delay-type interpretation. In particular, a low-order matching yields an effective representation in terms of an instantaneous contribution plus a delayed exponential term, providing a causal local surrogate of the finite-memory kernel. This local spectral viewpoint motivates a positive-delay exponential representation of the truncated kernel. The minimum number of positive-delay modes required to reach a prescribed spectral accuracy defines an operational delay-complexity measure, \(r_{\min}\). Overall, the truncated GL kernel emerges as an intermediate object between distributed fractional memory and delay-type dynamics, with a local spectral structure that is associated with the observed coherence loss and provides an operational diagnostic of effective delay complexity.

Explore related subjects

Keep this discovery

BibTeXRIS

Mattia Coccolo. 2026-05-05. Gr\"unwald--Letnikov Memory Truncation in a Fractional Duffing Oscillator: Coherence Loss and Effective Delay Complexity. https://doi.org/10.1016/j.chaos.2026.118775

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

KEEP EXPLORING

Related papers

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

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

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