Python 矩形矩阵的QR分解,其中n>;我学的是科学/数学

Python 矩形矩阵的QR分解,其中n>;我学的是科学/数学,python,numpy,scipy,linear-algebra,qr-decomposition,Python,Numpy,Scipy,Linear Algebra,Qr Decomposition,我有一个m×n的矩形矩阵a,其中n>m。给定秩r检查r的非零对角元素: import numpy as np min_tol = 1e-9 A = np.array([[1,2,3],[4,3,2],[1,1,1]]) print("Matrix rank of: {}".format(np.linalg.matrix_rank(A))) Q,R = np.linalg.qr(A) indep = np.where(np.abs(R.diagonal()) > min_tol)[0] p

我有一个m×n的矩形矩阵a,其中n>m。给定秩r检查r的非零对角元素:

import numpy as np
min_tol = 1e-9
A = np.array([[1,2,3],[4,3,2],[1,1,1]])
print("Matrix rank of: {}".format(np.linalg.matrix_rank(A)))
Q,R = np.linalg.qr(A)
indep = np.where(np.abs(R.diagonal()) >  min_tol)[0]
print(A[:, indep])
print("Independent columns are: {}".format(indep))
另见此处: