On the Implementation of the 0-1 Test for Chaos

By Georg A. Gottwald, Ian Melbourne. SIAM Journal on Applied Dynamical Systems, 2009

461 citations recorded by the source corpus.

In this paper we address practical aspects of the implementation of the 0–1 test for chaos in deterministic systems. In addition, we present a new formulation of the test which significantly increases its sensitivity. The test can be viewed as a method for distilling a binary quantity from the power spectrum. The implementation is guided by recent results from the theoretical justification of the test as well as by exploring better statistical methods for determining the binary quantities. We give several examples to illustrate the improvement.

Subfields: Computer Networks and Communications, Economics and Econometrics, Statistical and Nonlinear Physics

View Paper: https://www.semanticscholar.org/paper/f1f2c54487cf18c84ddb71aba70e175494d8d27c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Georg A. Gottwald
2. Ian Melbourne
3. Charalampos Skokos

In Economics and Econometrics

1. Georg A. Gottwald
2. Ian Melbourne
3. Charalampos Skokos

In Statistical and Nonlinear Physics

1. Georg A. Gottwald
2. Ian Melbourne
3. Charalampos Skokos
4. Alexander I. Bufetov
5. E. Rio

Citations in the corpus

• On the validity of the 0–1 test for chaos (2009, methodology): “(As demonstrated in [7], this is also greatly advantageous for the numerical implementation of the test.”