Given a m-by-n matrix with $n>>m$ and with a known rank of $k\leq m$, what would be a computationally effective way of finding out $k$ columns, such that the matrix formed using these $k$ columns has the best condition number?
2
-
$\begingroup$ Something to consider: Use some heuristic to select one or two columns, and then do Gram Schmidt orthonormalization to guess the best candidates for the rest. Gerhard "Ask Me About Dumb Guessing" Paseman, 2013.04.26 $\endgroup$– Gerhard PasemanCommented Apr 26, 2013 at 15:56
-
$\begingroup$ seems to be a duplicate of: mathoverflow.net/questions/104803/… $\endgroup$– SuvritCommented Apr 26, 2013 at 17:24
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
0
Finding this subset of columns is a non-trivial task, but some approximate answers are known. For details and pointers, please refer to my answer here.
