Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication

DOI10.1007/978-3-642-34862-4_2zbMath1385.68057arXiv1209.2184OpenAlexW1744930860MaRDI QIDQ4916029

Benjamin Lipshitz, Oded Schwartz, Grey Ballard, James W. Demmel, O. V. Holtz

Publication date: 19 April 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.3173

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30)

Related Items (11)

Faster All-Pairs Shortest Paths via Circuit Complexity ⋮ Unnamed Item ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ HPMaX: heterogeneous parallel matrix multiplication using CPUs and GPUs ⋮ Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra ⋮ Algebraic methods in the congested clique ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Improving the Complexity of Block Low-Rank Factorizations with Fast Matrix Arithmetic ⋮ Improving the Numerical Stability of Fast Matrix Multiplication ⋮ From Circuit Complexity to Faster All-Pairs Shortest Paths

This page was built for publication: Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication