是否有用于计算矩阵列或向量列表中所有对之间的所有成对点积的函数？

Question

Say you have n. vectors of arbitrary (but equal) length m each. Is there a (numpy?) function, or a quick way, of calculating all pairwise dot products between these n. vectors?

My initial thought was that you could calculate A ^T A and take the upper triangular portion, but I'm not sure if that matrix multiplication is slow/computationally intensive. Is there a quicker/efficient way? Or should I just define a function using a for loop for all combinations of pairs?

Answer 1

As per @Brenila's comment, use tensordot :

np.tensordot(arr, arr, axes=(0,0))

Result shape is (n, n) for n = arr.shape[-1]