Skip to Main content Skip to Navigation
Conference papers

Fast adaptive PARAFAC decomposition algorithm with linear complexity

Abstract : We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension grow- ing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Viet-Dung Nguyen Connect in order to contact the contributor
Submitted on : Friday, August 5, 2016 - 10:32:02 AM
Last modification on : Saturday, June 25, 2022 - 10:12:51 AM


Files produced by the author(s)


  • HAL Id : hal-01306461, version 1



Viet-Dung Nguyen, Karim Abed-Meraim, Linh-Trung Nguyen. Fast adaptive PARAFAC decomposition algorithm with linear complexity. International Conference on Acoustics, Speech and Signal Processing (ICASSP 2016), Mar 2016, Shanghai, China. ⟨hal-01306461⟩



Record views


Files downloads