Skip to main content

Table 2 Overall complexity in number of multiplications/additions per algorithm (approximated)

From: Greedy sparse decompositions: a comparative study

MP

(K + 1)NL + K2N

OMP

(K + 1)NL + K2(3N/2 + K2/12)

RMGS

(K + 1)NL + K2L/2

CMP

(K + 1)NL + K2N + N2(2L + N/3)

OCMP

NL(2N + L) + K(KL + L2 + KN)

OOCMP

4KNL + N3/3 + 2N2L

LARS

variable, depending on the number of steps

OOMP

4KNL

GP

(K + 1)NL + K2(10N + K2)/4