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

Balázs Bánhelyi, T. Csendes, Barnabás M. Garay

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings
DOIs
Publication statusPublished - 2006
Event12th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006 - Duisburg, United States
Duration: Sep 26 2006Sep 29 2006

Other

Other12th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006
CountryUnited States
CityDuisburg
Period9/26/069/29/06

Fingerprint

Chaos theory
Entropy

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Bánhelyi, B., Csendes, T., & Garay, B. M. (2006). Rigorous lower bounds for the topological entropy via a verified optimization technique. In 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings [4402400] https://doi.org/10.1109/SCAN.2006.39

Rigorous lower bounds for the topological entropy via a verified optimization technique. / Bánhelyi, Balázs; Csendes, T.; Garay, Barnabás M.

12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings. 2006. 4402400.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bánhelyi, B, Csendes, T & Garay, BM 2006, Rigorous lower bounds for the topological entropy via a verified optimization technique. in 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings., 4402400, 12th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Duisburg, United States, 9/26/06. https://doi.org/10.1109/SCAN.2006.39
Bánhelyi B, Csendes T, Garay BM. Rigorous lower bounds for the topological entropy via a verified optimization technique. In 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings. 2006. 4402400 https://doi.org/10.1109/SCAN.2006.39
Bánhelyi, Balázs ; Csendes, T. ; Garay, Barnabás M. / Rigorous lower bounds for the topological entropy via a verified optimization technique. 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings. 2006.
@inproceedings{05917001d968400f8e29ea6f0e07a13a,
title = "Rigorous lower bounds for the topological entropy via a verified optimization technique",
abstract = "Our automatic method developed for the detection of chaos is used for finding rigorous lower bounds for the topological entropy of the classical H{\'e}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.",
author = "Bal{\'a}zs B{\'a}nhelyi and T. Csendes and Garay, {Barnab{\'a}s M.}",
year = "2006",
doi = "10.1109/SCAN.2006.39",
language = "English",
isbn = "076952821X",
booktitle = "12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings",

}

TY - GEN

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

AU - Bánhelyi, Balázs

AU - Csendes, T.

AU - Garay, Barnabás M.

PY - 2006

Y1 - 2006

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

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

UR - http://www.scopus.com/inward/record.url?scp=47849083226&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47849083226&partnerID=8YFLogxK

U2 - 10.1109/SCAN.2006.39

DO - 10.1109/SCAN.2006.39

M3 - Conference contribution

SN - 076952821X

SN - 9780769528212

BT - 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, SCAN 2006, Conference Post-Proceedings

ER -