International Symposium on Nonlinear Theory and its Applications
A computer-assisted proof of chaotic behaviour of the area preserving Henon map
Balazs Banhelyi, Tibor Csendes, Barnabas M. Garay,
PDF download (310.9KB)
The problem of finding transition graphs with complicated structure (complicated enough to imply the existence of horseshoe?type chaos in dynamical systems) is reformulated as a constraint satisfaction problem in optimization theory. In order to find a chaotic region, our method combines a global optimization procedure and an interval arithmetic based checking routine. Computational results on the area?preserving Henon map are presented.