On the reliability of computed chaotic solutions of nonlinear differential equations
Shijun Liao

TL;DR
This paper introduces the critical predictable time $T_c$ to assess the reliability of computed chaotic solutions of nonlinear differential equations, revealing fundamental limits due to physical constraints like the Heisenberg uncertainty principle.
Contribution
It proposes the concept of critical predictable time $T_c$, providing a new criterion to evaluate the reliability of computed chaos solutions and exploring the physical limits of predictability.
Findings
Reliable chaotic solution of Lorenz equation achieved for $0 \,\leq t < 1200$
Data accuracy and numerical schemes significantly influence $T_c$
Prediction uncertainty of chaos is physically unavoidable, leading to the 'precision paradox of chaos'
Abstract
In this paper a new concept, namely the critical predictable time , is introduced to give a more precise description of computed chaotic solutions of nonlinear differential equations: it is suggested that computed chaotic solutions are unreliable and doubtable when . This provides us a strategy to detect reliable solution from a given computed result. In this way, the computational phenomena, such as computational chaos (CC), computational periodicity (CP) and computational prediction uncertainty, which are mainly based on long-term properties of computed time series, can be completely avoided. So, this concept also provides us a time-scale to determine whether or not a particular time is long enough for a given nonlinear dynamic system. Besides, the influence of data inaccuracy and various numerical schemes on the critical predictable time is investigated in details by…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
