Generating a d-dimensional linear subspace efficiently
Raphael Yuster · 2010
We present an algorithm for computing a d-dimensional subspace of the row space of a matrix. For an n x n matrix A with m nonzero entries and with rank(A) ≥ d the algorithm generates a d x n matrix with full row rank and which is a subspace of Rows(A). If rank(A)