Skip to main content

Table 1 Computational complexity of GGF-ALS, GGF-TALS methods

From: Generalized generating function with tucker decomposition and alternating least squares for underdetermined blind identification

Method

Operation

Complexity

GGF-ALS

ALS (one iteration)

O(3PKQ 2 + QKP 2 + Q 2 P 2)

GGF-TALS

SVD

O(Q 6)

 

ALS (one iteration)

O(3PLQ 2 + QLP 2 + Q 2 P 2)