从两个列表快速创建对角矩阵

时间:2018-11-21 19:48:16

标签: python python-3.x algorithm linear-algebra

给出2个列表,我想创建一个Diagonal matrix
一个列表将填充diagonal-constant,另一个列表将填充矩阵。

例如:

fast_matrix([1,2], [6,7,8])

应输出2个矩阵:

[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]

我的code makes 10000 transformations在我的PC中花了2.5秒。

from pprint import pprint
import timeit

def 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)))

我想知道它是否可以使用另一种方法更快。


Circulant中的scipy.linalg看起来像我想要的,但没有滚动:

from scipy.linalg import circulant

print(circulant([1, 8,7,6])) # <- Should be inverted
outputs:
[[1 6 7 8]
 [8 1 6 7]
 [7 8 1 6]
 [6 7 8 1]]

元素向右移动(推动)。

1 个答案:

答案 0 :(得分:1)

转置和展平的矩阵具有重复元素B的结构。这种方法使用该属性来创建矩阵的蓝图,该矩阵的对角线值错误,然后用正确的值填充对角线。

import numpy

def create_matrices(A, B):
    # Create blueprint of result matrix
    n = len(B) + 1
    b = numpy.empty((n * n,), dtype=numpy.int32)
    b[:-1] = numpy.repeat(B, n + 1)
    b = b.reshape((n, n)).T  # <- added transposition
    # Change diagonal elements
    for a in A:
        m = b.copy()
        numpy.fill_diagonal(m, a)
        print(m)

create_matrices([1, 2], [6, 7, 8])