.png){kind=icon}
返回
COMMUNICATION-OPTIMAL PARALLEL AND SEQUENTIAL QR AND LU FACTORIZATIONS
.png){kind=icon}
OA
AI
DOI：10.1137/080731992.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present parallel and sequential dense QR factorization algorithms that are both optimal (up to polylogarithmic factors) in the amount of communication they perform and just as stable as Householder QR. We prove optimality by deriving new lower bounds for the number of multiplications done by non-Strassen-like QR, and using these in known communication lower bounds that are proportional to the number of multiplications. We not only show that our QR algorithms attain these lower bounds (up to polylogarithmic factors), but that existing LAPACK and ScaLAPACK algorithms perform asymptotically more communication. We derive analogous communication lower bounds for LU factorization and point out recent LU algorithms in the literature that attain at least some of these lower bounds. The sequential and parallel QR 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.7 times over ScaLAPACK. A performance model for the parallel algorithm for general rectangular matrices predicts significant speedups over ScaLAPACK.
Keyword:
linear algebra
QR factorization
LU factorization
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
Domestic Violence and Chemical Dependency Co-Morbidity: Promoting Eclectic Responses to Concomitant Mental Health Concerns家庭暴力与化学依赖共病：促进对并存心理健康问题的折衷应对
PREAI
分享收藏Crystallographic Snapshots of Aspergillus fumigatus Phytase, Revealing Its Enzymatic Dynamics.png)
Structure
OAAI
StructureIF0
OAAI分享收藏
查看更多内容