Avoiding communication in numerical linear algebra

DOI10.1137/1.9781611972917.6MaRDI QIDQ5233697zbMATH OpenOpenAlexFDO

Authors James Demmel

Publication date 12 September 2019

Published in 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972917.6

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Analysis of algorithms (68W40)

Recommendations

• Communication lower bounds and optimal algorithms for numerical linear algebra
• Minimizing communication in numerical linear algebra
• Communication-avoiding symmetric-indefinite factorization
• Communication-optimal parallel and sequential Cholesky decomposition
• Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra

Cited in

(6)

• Reducing communication costs for sparse matrix multiplication within algebraic multigrid
• Minimizing communication in numerical linear algebra
• Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
• Communication lower bounds and optimal algorithms for numerical linear algebra
• Communication-optimal parallel and sequential Cholesky decomposition
• Communication Avoiding ILU0 Preconditioner

This page was built for publication: Avoiding communication in numerical linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233697)