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?

回答(1 个)

Torsten
Torsten 2016-1-8
编辑:Torsten 2016-1-8
  2 个评论
Qiu
Qiu 2016-1-8
Thank you so much, but these papers are difficult for me to comprehend, as I am not major in algebra or mathematics. I encounter this question on the works of Spectrum Estimation of Camera. So it will be appreciate if there exists prepared toolbox.
Torsten
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.

请先登录,再进行评论。

类别

Help CenterFile Exchange 中查找有关 MATLAB 的更多信息

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by