Recent posts
https://software.intel.com/en-us/recent/784873
enDGEQRF performance on block p-cyclic matrix
https://software.intel.com/en-us/forums/topic/337559
<p>Hello, first time poster here. </p>
<p>My work includes finding the QR decomposition of a p-cyclic matrix M. It is square, L blocks high, L blocks wide, and each block is N by N. Each block column has two nonzero blocks on and directly below the diagonal, like so</p>
<p>M11 M1L<br />M21 M22<br /> M32 M33<br /> ... ...<br /> MLL-1 MLL</p>
<p>I am using a Block Orthogonal Factorization method to find the QR but want to compare it to DGEQRF in terms of time and speed. The code is attached.</p>
<p>Now my problem is that although BSOF always has a better timing than DGEQRF, as L increases and the amount of zeroes in M increases, DGEQRF gets much much faster in terms of GFlop/s. Attached are results from a test where the size of M is constant at 10,000 and L grows as N decreases. If DGEQRF were unaffected by structure, its speed and execution time would be the same for each test, but it is not. So my question is why is DGEQRF going so fast? My theory is that there is some heuristic which skips some amount of flops when it sees some formation of zeroes, making my flop count incorrect and leading to a bad GFlop rate. But I have no idea how/where this is being done.</p>
</p>
<p>I should also note that I have run benchmark testing with DGEMM and DGEQRF on a fully random matrix and get normal speeds of ~140GFlops and ~120GFlops respectively. So my DGEQRF speeds on M of ~1000GFlops must be off. Those results are attached as well.</p>
<p>Thanks!</p>
Tue, 13 Nov 12 18:17:54 -0800Jeffrey P.337559