A computation of the limit capacity of the Lorenz attractor (Q1074929)

The limit capacity of the Lorenz attractor is studied numerically. The box-counting algorithm by Takens encounters a slow convergence problem. The reason is that the corresponding interval cusp-shaped map has absolutely continuous invariant probability of density approaching zero at the ends of the interval. So the corresponding boxes scarcely appear. An extrapolation procedure to resolve the problem is discussed.