DocumentCode :
2379366
Title :
Rigorous lower bounds for the topological entropy via a verified optimization technique
Author :
Banhelyi, B. ; Csendes, Tibor ; Garay, Barnabás M.
Author_Institution :
Univ. of Szeged, Szeged
fYear :
2006
fDate :
26-29 Sept. 2006
Firstpage :
10
Lastpage :
10
Abstract :
Our automatic method developed for the detection of chaos is used for finding rigorous lower bounds for the topological entropy of the classical Henon 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.
Keywords :
chaos; entropy; graph theory; mathematics computing; Henon mapping; chaos detection; rigorous lower bounds; topological entropy; verified optimization technique; Chaos; Constraint optimization; Differential equations; Embedded computing; Entropy; Informatics; Integral equations; Mathematics; Optimization methods; Sufficient conditions;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Scientific Computing, Computer Arithmetic and Validated Numerics, 2006. SCAN 2006. 12th GAMM - IMACS International Symposium on
Conference_Location :
Duisburg
Print_ISBN :
978-0-7695-2821-2
Type :
conf
DOI :
10.1109/SCAN.2006.39
Filename :
4402400
Link To Document :
بازگشت