The computational complexity of the mean matrix can be upper bounded by counting the number of multiplication operations. In this case, the Riemannian mean can be evaluated via an iterative procedure with (3an3 + an2)tk multiplications, where a denotes the number of HPD matrices for averaging,...