Table 1.

Computational time of correlation sums estimated for Lorenz attractor series of different sample lengths. S _p is the speed-up achieved and defined as S _p = T _Seq/T _MO, where T _Seq is the time demand for a sequential algorithm and T _MO the time demand for the proposed technique based on matrix operations.

N (samples)	T Seq (s)	T MO (s)	S p
300	1086	0.9	≈1200
5000	8.69e5	50	≈16000
10000	3.63e6	300	≈12000