Rigorous lower bounds for the topological entropy via a verified optimization technique

Bal´azs B´anhelyi, Tibor Csendes, Barnab´as M. Garay
2006 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)  
Our automatic method developed for the detection of chaos is used for finding rigorous lower bounds for the topological entropy of the classical Hénon mapping. We do this within the abstract framework created by Galias and Zgliczynski in 2001 , and focus on covering graphs involving different iterations. Our results are compared to those obtained by them.
doi:10.1109/scan.2006.39 fatcat:ayrgxa46gnhjvfhn5b4yvp73ve