python实现二维数组的笛卡尔积_两个二维阵列的笛卡尔积

假设每个点都有坐标。

我想找出位置向量在每一点$I$与每隔一点$j$的内积。本质上是两个二维数组的笛卡尔积。在

在Python中，实现这一点的最快方法是什么？在

我当前的实现如下所示：def cartesian_product(arrays):

broadcastable = np.ix_(*arrays)

broadcasted = np.broadcast_arrays(*broadcastable)

rows, cols = reduce(np.multiply, broadcasted[0].shape), len(broadcasted)

out = np.empty(rows * cols, dtype=broadcasted[0].dtype)

start, end = 0, rows

for a in broadcasted:

out[start:end] = a.reshape(-1)

start, end = end, end + rows

return out.reshape(cols, rows).T

def inner_product():

x, y = np.meshgrid(np.arange(4),np.arange(4))

cart_x = cartesian_product([x.flatten(),x.flatten()])

cart_y = cartesian_product([y.flatten(),y.flatten()])

Nx = x.shape[0]

xx = (cart_x[:,0]*cart_x[:,1]).reshape((Nx**2,Nx,Nx))

yy = (cart_y[:,0]*cart_y[:,1]).reshape((Nx**2,Nx,Nx))

inner_products = xx+yy

return inner_products

但这行不通。对于较大的数组(比如256x256)，这会给我一个内存错误。在