How to find a subset of a matrix that has minimum condition number?
4 次查看(过去 30 天)
显示 更早的评论
Suppose matrix A is consist of M column vectors, how can we find a subset B, consisting of N column of A (N<M), that has minimum condition number (the ratio of maximum singular value by minimum singular value)? If we try all possible combination of columns in A, the amount is tremendous, for example if M = 100, N = 50, there is 10^29 combinations. So is there a faster algorithm?
0 个评论
回答(1 个)
Torsten
2016-1-8
编辑:Torsten
2016-1-8
Maybe of interest for you:
Best wishes
Torsten.
2 个评论
Torsten
2016-1-8
I think one should consult the papers first to find out whether a faster algorithm than the obvious one you suggested exists. If this question is answered positive, one can search for MATLAB implementations.
Best wishes
Torsten.
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!