How many floating point operations are required for the function "pinv"?
3 次查看(过去 30 天)
显示 更早的评论
i want to find pinv of complex correlation matrix of NXN how many addition ,multiplication are required of the number of floating Counts or flops?
2 个评论
James Tursa
2016-5-25
What do you intend to do with this information? Would timing with tic & toc be more meaningful to you?
采纳的回答
更多回答(1 个)
Walter Roberson
2016-5-25
Is the question about pinv() as implemented by Mathworks, or is the question about how efficiently a Moore-Penrose Pseudo-Inverse could be done in theory? If you are talking about algorithmic complexity rather than about implementation then see http://cs.stackexchange.com/questions/24060/complexity-of-finding-the-pseudoinverse-matrix
2 个评论
Walter Roberson
2016-5-26
It is not possible to measure that on any modern processor. It has been fundamentally unmeasurable since the introduction of the MIPS R8000 in 1994, which introduced conditional movements and out-of-order execution; the 1996 introduction of the MIPS R10000 chip especially made it really impossible.
For example on modern Intel architectures you need to worry about how to count operations coded as Multiply And Add instructions, or coded as HADDPD (Packed Double-Floating Point Horizontal Add).
The closest you can get is a Cycle Counter. But that is pretty unreliable; see https://software.intel.com/en-us/node/561442
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Problem-Based Optimization Setup 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!