In this paper the fractional order logistic map in the sense of Caputo's fractional differences is numerically approached. It is shown that the necessary iterations number to avoid transients must be of order of thousand, not of order of hundreds as commonly used in several works. Also, it is revealed an interesting phenomenon according to which for every initial condition it correspond a different bifurcation diagram. This phenomenon seems to appear also in other FO difference systems, fact which could represent an obstacle for the numerical analysis. A short Matlab code is used to obtain the results.
翻译:在本文中,从数字角度对卡普托的分数差异意义上的分序后勤地图进行了处理,表明避免瞬间变化的必要迭代数必须按千次顺序排列,而不是若干作品通常使用的数百次顺序排列。此外,还揭示出一个有趣的现象,根据这种现象,每个初始条件,它都对应不同的两条形图。这种现象似乎也出现在其他FO差异系统中,这一事实可能构成数字分析的障碍。一个简短的 Matlab 代码被用来获取结果。