I'm struggling with the following problem: I have some very big matrices (say, at least, 2000x2000, and probably in the future they will even reach 10000x10000) with very small rank (2 or 3, call it N) and I need to find an efficient Python routine to extract the linear independent rows (or columns, the matrix is symmetric!) From them. I tried to take the first N columns of the Q matrix of QR decomposition but it seems not to work correctly (is this wrong maybe?).
Here's the Python code I use to implement the method suggested by Ami Tavory:
from numpy import absolute
from numpy.linalg import qr
q = qr(R)[1] #R is my matrix
q = absolute(q)
sums = sum(q,axis=1)
i = 0
while( i < dim ): #dim is the matrix dimension
if(sums[i] > 1.e-10):
print "%d is a good index!" % i
i += 1
This should tell me if the row is non-zero and therefore if the I-th column of R is linearly independent.
To find if rows of matrix are linearly independent, we have to check if none of the row vectors (rows represented as individual vectors) is linear combination of other row vectors. Turns out vector a3 is a linear combination of vector a1 and a2. So, matrix A is not linearly independent.
Number of non zero rows is 2. So rank of the given matrix = 2. If number of non zero vectors = number of given vectors,then we can decide that the vectors are linearly independent.
This number (i.e., the number of linearly independent rows or columns) is simply called the rank of A. A matrix is said to have full rank if its rank equals the largest possible for a matrix of the same dimensions, which is the lesser of the number of rows and columns.
The Gram Schmidt process finds a basis (equivalently largest independent subset) using linear combinations, and the QR Decomposition effectively mimics this.
Therefore, one way to do what you want is to apply numpy.linalg.qr
to the transpose, and check the non-zero components of the R matrix. The corresponding columns (in the transpose matrix, i.e., the rows in your original matrix) are independent.
Edit After some searching, I believe this Berkeley lecture explains it, but here are examples
import numpy as np
# 2nd column is redundant
a = np.array([[1, 0, 0], [0, 0, 0], [1, 0, 1]])
>> np.linalg.qr(a)[1] # 2nd row empty
array([[ 1.41421356, 0. , 0.70710678],
[ 0. , 0. , 0. ],
[ 0. , 0. , 0.70710678]])
# 3rd column is redundant
a = np.array([[1, 0, 0], [1, 0, 1], [0, 0, 0], ])
>> np.linalg.qr(a)[1] # 3rd row empty
array([[ 1.41421356, 0. , 0.70710678],
[ 0. , 0. , -0.70710678],
[ 0. , 0. , 0. ]])
# No column redundant
a = np.array([[1, 0, 0], [1, 0, 1], [2, 3, 4], ])
>> np.linalg.qr(a)[1] # No row empty
array([[ 2.44948974, 2.44948974, 3.67423461],
[ 0. , 1.73205081, 1.73205081],
[ 0. , 0. , 0.70710678]])
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With