Browsing by Author Nguyen, Linh Trung

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 2 to 2 of 2
  • IEEE%20Xplore%20Abstract%20-%20Fast%20adaptive%20PARAFAC%20decomposition%20algorithm%20with%20linear%20complexity.pdf.jpg
  • Article


  • Authors: Nguyen, Viet Dung; Karim, Abed-Meraim; Nguyen, Linh Trung (2016)

  • 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 growing 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.

Browsing by Author Nguyen, Linh Trung

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 2 to 2 of 2
  • IEEE%20Xplore%20Abstract%20-%20Fast%20adaptive%20PARAFAC%20decomposition%20algorithm%20with%20linear%20complexity.pdf.jpg
  • Article


  • Authors: Nguyen, Viet Dung; Karim, Abed-Meraim; Nguyen, Linh Trung (2016)

  • 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 growing 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.