SearcharxivSearch

arXiv · nlin/0506045

Computed Chaos or Numerical Errors

Abstract

Discrete numerical methods with finite time-steps represent a practical technique to solve initial-value problems involving nonlinear differential equations. These methods seem particularly useful to the study of chaos since no analytical chaotic solution is currently available. Using the well-known Lorenz equations as an example, it is demonstrated that numerically computed results and their associated statistical properties are time-step dependent. There are two reasons for this behavior. First, chaotic differential equations are unstable so that any small error is amplified exponentially near an unstable manifold. The more serious and lesser-known reason is that stable and unstable manifolds of singular points associated with differential equations can form virtual separatrices. The existence of a virtual separatrix presents the possibility of a computed trajectory actually jumping through it due to the finite time-steps of discrete numerical methods. Such behavior violates the uniqueness theory of differential equations and amplifies the numerical errors explosively. These reasons imply that, even if computed results are bounded, their independence on time-step should be established before accepting them as useful numerical approximations to the true solution of the differential equations. However, due to these exponential and explosive amplifications of numerical errors, no computed chaotic solutions of differential equations independent of integration-time step have been found. Thus, reports of computed non-periodic solutions of chaotic differential equations are simply consequences of unstably amplified truncation errors, and are not approximate solutions of the associated differential equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Lun-Shin Yao. 2005-06-21. Computed Chaos or Numerical Errors. https://arxiv.org/abs/nlin/0506045

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