Table 2 Computational complexity of basic matrix operations
From: Target detection based on generalized Bures–Wasserstein distance
Operation | computational cost |
|---|---|
R1R2 | 8n3-2n2 |
R1 + R2 | 2n2 |
Tr(R1) | 8n2-6n-2 |
det(R1) | 8n2-2n-6 |
R1−1 | 8n3-2n2 |
R11/2 | 24n3 + 2n2-8n |
exp(R1) | n4/2 + 24n3 + 3n2/2-n |
log(R1) | n4/2 + 25n3 + n2-3n/2 |