{"title":"对logistic映射的周期窗密度进行了严格的数值研究。","authors":"Zbigniew Galias","doi":"10.1063/5.0250869","DOIUrl":null,"url":null,"abstract":"<p><p>Numerical study of periodic windows for the logistic map is carried out. Accurate rigorous bounds for periodic windows' end points are computed using interval arithmetic based tools. An efficient method to find the periodic window with the smallest period lying between two other periodic windows is proposed. The method is used to find periodic windows extremely close to selected points in the parameter space and to find a set of periodic windows to minimize the maximum gap between them. The maximum gap reached is 4×10-9. The phenomenon of the existence of regions free from low-period windows is explained.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"35 1","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rigorous numerical study of the density of periodic windows for the logistic map.\",\"authors\":\"Zbigniew Galias\",\"doi\":\"10.1063/5.0250869\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Numerical study of periodic windows for the logistic map is carried out. Accurate rigorous bounds for periodic windows' end points are computed using interval arithmetic based tools. An efficient method to find the periodic window with the smallest period lying between two other periodic windows is proposed. The method is used to find periodic windows extremely close to selected points in the parameter space and to find a set of periodic windows to minimize the maximum gap between them. The maximum gap reached is 4×10-9. The phenomenon of the existence of regions free from low-period windows is explained.</p>\",\"PeriodicalId\":9974,\"journal\":{\"name\":\"Chaos\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":2.7000,\"publicationDate\":\"2025-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1063/5.0250869\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0250869","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Rigorous numerical study of the density of periodic windows for the logistic map.
Numerical study of periodic windows for the logistic map is carried out. Accurate rigorous bounds for periodic windows' end points are computed using interval arithmetic based tools. An efficient method to find the periodic window with the smallest period lying between two other periodic windows is proposed. The method is used to find periodic windows extremely close to selected points in the parameter space and to find a set of periodic windows to minimize the maximum gap between them. The maximum gap reached is 4×10-9. The phenomenon of the existence of regions free from low-period windows is explained.
期刊介绍：
Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
