{"title":"Logistic映射的多项式熵","authors":"Milan Perić","doi":"10.1556/012.2021.58.2.1494","DOIUrl":null,"url":null,"abstract":"We study the polynomial entropy of the logistic map depending on a parameter, and we calculate it for almost all values of the parameter. We show that polynomial entropy distinguishes systems with a low complexity (i.e. for which the topological entropy vanishes).","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial Entropy of the Logistic Map\",\"authors\":\"Milan Perić\",\"doi\":\"10.1556/012.2021.58.2.1494\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the polynomial entropy of the logistic map depending on a parameter, and we calculate it for almost all values of the parameter. We show that polynomial entropy distinguishes systems with a low complexity (i.e. for which the topological entropy vanishes).\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2021-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1556/012.2021.58.2.1494\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1556/012.2021.58.2.1494","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study the polynomial entropy of the logistic map depending on a parameter, and we calculate it for almost all values of the parameter. We show that polynomial entropy distinguishes systems with a low complexity (i.e. for which the topological entropy vanishes).
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
