通过使用gmpy2.divm替换您的division_mod,我可以节省几秒钟的运行时间。我无法做出任何其他重大的改进。下面的程序创建一个随机的100×2^15矩阵,并在大约3分钟内计算出行梯队形式,并消耗425MB内存。在import gmpy2
bits = 256
r = 100
c = 2**15
p = gmpy2.next_prime(2**bits - 1234)
seed = gmpy2.random_state(42)
M = []
for i in range(r):
M.append([gmpy2.mpz_urandomb(seed, bits) for j in range(c)])
def row_echelon_form(M, p):
lead = 0
rowCount = len(M)
columnCount = len(M[0])
for r in range(rowCount):
if lead >= columnCount:
return
i = r
while M[i][lead] == 0:
i += 1
if i == rowCount:
i = r
lead += 1
if columnCount == lead:
return
M[i],M[r] = M[r],M[i]
lv = M[r][lead]
M[r] = [ gmpy2.divm(mrx, lv, p) for mrx in M[r]]
for i in range(rowCount):
if i != r:
lv = M[i][lead]
M[i] = [ (iv - lv*rv) % p for rv,iv in zip(M[r],M[i])]
lead += 1
return M
N = row_echelon_form(M, p)
如果您的内存使用量增长超过大约500MB,则您的gmpy2版本中可能存在内存泄漏。或者我错误地解释了您的需求,而矩阵明显更大。在
免责声明:我维护gmpy2。在