給定 2 個(gè)列表,我想創(chuàng)建一個(gè)Diagonal matrix.一個(gè)列表將填充diagonal-constant,另一個(gè)將填充矩陣。例如:fast_matrix([1,2], [6,7,8])應(yīng)該輸出2個(gè)矩陣:[2] # unused[1, 6, 7, 8][6, 1, 7, 8][6, 7, 1, 8][6, 7, 8, 1]和[1] # unused[2, 6, 7, 8][6, 2, 7, 8][6, 7, 2, 8][6, 7, 8, 2]我的代碼在 2.5 秒內(nèi)在我的電腦上進(jìn)行了 10000 次轉(zhuǎn)換。from pprint import pprintimport timeitdef not_so_fast_matrix(A, B): rt_obj = [] for i,_ in enumerate(A): for z in range(len(B) + 1): new_from = A.copy() new_from.remove(A[i]) new_list = B.copy() new_list.insert(z, A[i]) rt_obj.append({'remain': new_from, 'to_list': new_list}) return rt_obj# pprint(not_so_fast_matrix([1,2], [6,7,8]))A = ([1,2,3,4,5,6,7,8,9,10])B = ([60,70,80,90,100,200,300])t = timeit.Timer(lambda: not_so_fast_toeplitz(A, B))print("not_so_fast_matrix took: {:.3f}secs for 10000 iterations".format(t.timeit(number=10000)))我想知道使用另一種方法是否可以更快。Circulantfromscipy.linalg看起來(lái)像我想要的但沒(méi)有滾動(dòng):from scipy.linalg import circulantprint(circulant([1, 8,7,6])) # <- Should be invertedoutputs:[[1 6 7 8] [8 1 6 7] [7 8 1 6] [6 7 8 1]]元素被向右移動(dòng)(推)。
查看完整描述