Fast Computation of Recurrences in Long Time Series

We present an approach to recurrence quantification analysis (RQA) that allows to process very long time series fast. To do so, it utilizes the paradigm Divide and Recombine. We divide the underlying matrix of a recurrence plot ( RP) into sub matrices. The processing of the sub matrices is distributed across multiple graphics processing unit (GPU) devices. GPU devices perform RQA computations very fast since they match the problem very well. The individual results of the sub matrices are recombined into a global RQA solution. To address the specific challenges of subdividing the recurrence matrix, we introduce means of synchronization as well as additional data structures. Outperforming existing implementations dramatically, our GPU implementation of RQA processes time series consisting of N approximate to 1,000,000 data points in about 5min.