Implementing Communication-Optimal Parallel and Sequential QR Factorizations
From MaRDI portal
Abstract: We present parallel and sequential dense QR factorization algorithms for tall and skinny matrices and general rectangular matrices that both minimize communication, and are as stable as Householder QR. The sequential and parallel algorithms for tall and skinny matrices lead to significant speedups in practice over some of the existing algorithms, including LAPACK and ScaLAPACK, for example up to 6.7x over ScaLAPACK. The parallel algorithm for general rectangular matrices is estimated to show significant speedups over ScaLAPACK, up to 22x over ScaLAPACK.
This page was built for publication: Implementing Communication-Optimal Parallel and Sequential QR Factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6210890)
