6 citations · 6 across the 1 of their papers we have counts for
1 paper
Sraban Kumar Mohanty
We analyse some QR decomposition algorithms, and show that the I/O complexity of the tile based algorithm is asymptotically the same as that of matrix multiplication. This algorith…