Graph Expansion Analysis for Communication Costs of Fast Rectangular Matrix Multiplication
Preprint
Abstract
Graph expansion analysis of computational DAGs is useful for obtaining communication cost lower bounds where previous methods, such as geometric embedding, are not applicable. This has recently been demonstrated for Strassen's and Strassen-like fast square matrix multiplication algorithms. Here we extend the expansion analysis approach to fast algorithms for rectangular matrix multiplication, obtaining a new class of communication cost lower bounds. These apply, for example to the algorithms of Bini et al. (1979) and the algorithms of Hopcroft and Kerr (1971). Some of our bounds are proved to be optimal.Keywords
All Related Versions
- Version 1, 2012-09-11, ArXiv
- Published version: Lecture Notes in Computer Science, 13.
This publication has 19 references indexed in Scilit:
- Fast rectangular matrix multiplication and some applicationsScience China Mathematics, 2008
- Communication lower bounds for distributed-memory matrix multiplicationJournal of Parallel and Distributed Computing, 2004
- Fast Rectangular Matrix Multiplication and ApplicationsJournal of Complexity, 1998
- Rectangular Matrix Multiplication RevisitedJournal of Complexity, 1997
- Fast rectangular matrix multiplication and QR decompositionLinear Algebra and its Applications, 1995
- Parallel evaluation of the determinant and of the inverse of a matrixInformation Processing Letters, 1989
- Size bounds for superconcentratorsTheoretical Computer Science, 1983
- On the asymptotic complexity of rectangular matrix multiplicationTheoretical Computer Science, 1983
- Relations between exact and approximate bilinear algorithms. ApplicationsCalcolo, 1980
- O(n2.7799) complexity for n × n approximate matrix multiplicationInformation Processing Letters, 1979