qr decomposition run-time performance
10 次查看(过去 30 天)
显示 更早的评论
Hi,
I'm comparing the run-time of the "qr" function:
Option1: R = triu(qr(A))
Option2: [~, R]=qr(A) (or [Q, R]=qr(A)),
Only the "R" output is required.
I've tested them on a large number of possible choices of A, a full (not-sparse) matrix with m >> n.
The result was a significant run-time advantage for triu(qr(A)).
To the best of my knowlegde from Matlab documention, option1 use LAPACK xGEQRF Householder Reflectors, but I couldn't find how option2 was implemented.
Can anyone explain what is (or may be) the cause for such performance difference?
(Using Matlab R2019b)
Thank you in advance!
0 个评论
回答(2 个)
Bruno Luong
2020-8-31
编辑:Bruno Luong
2020-8-31
I'm pretty sure both Q-less-qr and qr use the same algorithm.
What you should try is
Option 3
[~, R] = qr(A,0);
that will return (n x n) R matrix without the bottom part padded with 0.
It's about 2 times slower than q-less qr, but it can be simply explained by Q (m x n) that is built and cleared.
If you do the Option2
[~, R] = qr(A);
the invisible cleared Q is (m x m), totally useless orthogonal much bigger matrix that has been built and then cleared.
4 个评论
Christine Tobler
2020-9-1
When a "~" is used for a return value, this is only for code clarity. MATLAB still needs to compute that value, so the second case is computing the Q, even though you don't intend to use it.
0 个评论
另请参阅
类别
在 Help Center 和 File Exchange 中查找有关 Function Creation 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!