Fractal properties of numerical convergence for the logistic map
The discrete logistic map is a simple population dynamics model in quadratic form. This model is well studied and it is well known that it yields rich dynamical complexities such as bifurcation, fractality and chaos. In this work, we revisit the logistic map and investigate a region where no particular complexity has been studied. By numerically gauging the speed of convergence, we have found an interesting structure displaying some fractal properties.