rank() computation cost

6 次查看（过去 30 天）

Nicolas Mira Gebauer 2021-11-30

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1599264-rank-computation-cost

评论： Walter Roberson 2021-12-6

Hi, does anyone knows which is the computational cost of getting the rank of a matrix through the rank(M) command? (It would be extremelly usefull to have the order of the command using the Big O notation.

Thank you in advance!

Nicolas

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

采纳的回答

Shanmukha Voggu 2021-12-3

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1599264-rank-computation-cost#answer_846560

编辑：Shanmukha Voggu 2021-12-3

Hi Nicholas,

The Computational Complexity of the rank function is equal to svd function.

which is equal to O(max(m, n) * min(m, n)^2), where m and n are number of rows and columns of the matrix respectively

Refer this for more information.

5 个评论
显示 3更早的评论隐藏 3更早的评论

Nicolas Mira Gebauer 2021-12-6

Thank you both for the clarification!

Walter Roberson 2021-12-6

I was wondering! max(m, n) *min(m, n) as was posted before is the same as m*n, and I couldn't figure out why someone would bother writing it the long way!

请先登录，再进行评论。