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

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

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 iterati...

Full description

Saved in:
Bibliographic Details
Published in:12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006) p. 10
Main Authors: Banhelyi, B., Csendes, T., Garay, B.M.
Format: Conference Proceeding
Language:English
Published: IEEE 01-09-2006
Subjects:
Chaos
Constraint optimization
Differential equations
Embedded computing
Entropy
Informatics
Integral equations
Mathematics
Optimization methods
Sufficient conditions
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/SCAN.2006.39