pith. sign in

arxiv: 1401.0256 · v1 · pith:NEBUIUSRnew · submitted 2014-01-01 · 🌊 nlin.CD

A comment on the arguments about the reliability and convergence of chaotic simulations

classification 🌊 nlin.CD
keywords chaoticnumericallorenzsolutiontellus-aalgorithmapproximationsarguments
0
0 comments X
read the original abstract

Yao and Hughes commented (Tellus-A, 60: 803 - 805, 2008) that "all chaotic responses are simply numerical noise and have nothing to do with the solutions of differential equations". However, using 1200 CPUs of the National Supercomputer TH-A1 and a parallel integral algorithm of the so-called "Clean Numerical Simulation" (CNS) based on the 3500th-order Taylor expansion and data in 4180-digit multiple precision, one can gain reliable, convergent chaotic solution of Lorenz equation in a rather long interval [0,10000]. This supports Lorenz's optimistic viewpoint (Tellus-A, 60: 806 - 807, 2008): "numerical approximations can converge to a chaotic true solution throughout any finite range of time".

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.