SearcharxivSearch

arXiv · 2410.06122

On the Melnikov method for fractional-order systems

Abstract

This paper is dedicated to clarifying and introducing the correct application of Melnikov method in fractional dynamics. Attention to the complex dynamics of hyperbolic orbits and to fractional calculus can be, respectively, traced back to Poincar\'es attack on the three-body problem a century ago and to the early days of calculus three centuries ago. Nowadays, fractional calculus has been widely applied in modeling dynamic problems across various fields due to its advantages in describing problems with non-locality. Some of these models have also been confirmed to exhibit hyperbolic orbit dynamics, and recently, they have been extensively studied based on Melnikov method, an analytical approach for homoclinic and heteroclinic orbit dynamics. Despite its decade-long application in fractional dynamics, there is a universal problem in these applications that remains to be clarified, i.e., defining fractional-order systems within finite memory boundaries leads to the neglect of perturbation calculation for parts of the stable and unstable manifolds in Melnikov analysis. After clarifying and redefining the problem, a rigorous analytical case is provided for reference. Unlike existing results, the Melnikov criterion here is derived in a globally closed form, which was previously considered unobtainable due to difficulties in the analysis of fractional-order perturbations characterized by convolution integrals with power-law type singular kernels. Finally, numerical methods are employed to verify the derived Melnikov criterion. Overall, the clarification for the problem and the presented case are expected to provide insights for future research in this topic.

Explore related subjects

Keep this discovery

BibTeXRIS

Hang Li, Yongjun Shen, Jian Li, Jinlu Dong, Guangyang Hong. 2024-10-08. On the Melnikov method for fractional-order systems. https://doi.org/10.1016/j.chaos.2024.115602

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