A parallel method is presented to compute the Kolmogorov entropy from a time series in a direct manner, evaluating the probabilities of the box sequences. This approach leads to a particular string matching problem. The algorithm is tested on a distributed memory multiprocessor, showing good performance and allowing a fast analysis of very long time series.
A parallel approach to compute the Kolmogorov entropy from a time series
Corana A;
1995
Abstract
A parallel method is presented to compute the Kolmogorov entropy from a time series in a direct manner, evaluating the probabilities of the box sequences. This approach leads to a particular string matching problem. The algorithm is tested on a distributed memory multiprocessor, showing good performance and allowing a fast analysis of very long time series.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
