通过验证优化技术得到拓扑熵的严格下界

12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006) Pub Date : 2006-09-26 DOI:10.1109/SCAN.2006.39

B. Bánhelyi, T. Csendes, B. Garay

{"title":"通过验证优化技术得到拓扑熵的严格下界","authors":"B. Bánhelyi, T. Csendes, B. Garay","doi":"10.1109/SCAN.2006.39","DOIUrl":null,"url":null,"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.","PeriodicalId":388600,"journal":{"name":"12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rigorous lower bounds for the topological entropy via a verified optimization technique\",\"authors\":\"B. Bánhelyi, T. Csendes, B. Garay\",\"doi\":\"10.1109/SCAN.2006.39\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":388600,\"journal\":{\"name\":\"12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)\",\"volume\":\"72 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCAN.2006.39\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCAN.2006.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们开发的用于混沌检测的自动方法用于寻找经典Henon映射拓扑熵的严格下界。我们在Galias和Zgliczynski于2001年创建的抽象框架中进行此工作，并重点关注涉及不同迭代的图。我们的结果与他们的结果进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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 iterations. Our results are compared to those obtained by them.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006)

自引率

0.00%

发文量