A bound on the minimum rank of solutions to sparse linear matrix equations.

Raphael Louca Subhonmesh Bose Eilyan Bitar

Published in: ACC (2016)

Keyphrases

sparse linear
sparse matrix
low rank
polynomial equations
least squares
singular values
upper bound
singular value decomposition
optimal solution
lower bound
nearest neighbor
worst case
feasible solution
matrix factorization
simplex algorithm