Fast adaptive PARAFAC decomposition algorithm with linear complexity
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...
Saved in:
Main Authors: | Nguyen, Viet Dung, Karim, Abed-Meraim, Nguyen, Linh Trung |
---|---|
Format: | Article |
Language: | English |
Published: |
ĐHCN
2016
|
Subjects: | |
Online Access: | http://repository.vnu.edu.vn/handle/VNU_123/13033 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Vietnam National University, Hanoi |
Language: | English |
Similar Items
-
Periodic sequences with maximal linear complexity and large k-error linear complexity
by: Meidl, W., et al.
Published: (2014) -
Error linear complexity measures for multisequences
by: Meidl, W., et al.
Published: (2014) -
Studies on error linear complexity measures for multisequences
by: AYINEEDI VENKATESWARLU
Published: (2010) -
The probabilistic theory of the joint linear complexity of multisequences
by: Niederreiter, H.
Published: (2014) -
The asymptotic behavior of the joint linear complexity profile of multisequences
by: Niederreiter, H., et al.
Published: (2014)