论文信息 - A vectorized algorithm for correlation dimension estimation

A vectorized algorithm for correlation dimension estimation

Abstract We present an algorithm for the efficient and reliable computation of the Grassberger-Procaccia correlation dimension in cases where the correlation integral is constructed using all pairs of points. This algorithm is explicitly designed for modern super-scalar processors.

[1] P. Grassberger. An optimized box-assisted algorithm for fractal dimensions , 1990 .

[2] B. Hao,et al. Directions in chaos , 1987 .

[3] Neil Gershenfeld,et al. An Experimentalist’s Introduction to the Observation of Dynamical Systems , 1988 .

[4] David A. Patterson,et al. Computer Architecture - A Quantitative Approach, 5th Edition , 1996 .

[5] Mark Kot,et al. Multidimensional trees, range searching, and a correlation dimension algorithm of reduced complexity , 1989 .

[6] Physics Letters , 1962, Nature.

[7] P. Grassberger,et al. Measuring the Strangeness of Strange Attractors , 1983 .

[8] Gottfried Mayer-Kress,et al. APPLICATION OF DIMENSION ALGORITHMS TO EXPERIMENTAL CHAOS , 1987 .

[9] Theiler,et al. Efficient algorithm for estimating the correlation dimension from a set of discrete points. , 1987, Physical review. A, General physics.

[10] Neil Gershenfeld,et al. Dimension measurement on high-dimensional systems , 1992 .

[11] David A. Patterson,et al. Computer Architecture: A Quantitative Approach , 1969 .