New combinations of methods for the acceleration of matrix multiplication

DOI10.1016/0898-1221(81)90009-2zbMath0465.68019OpenAlexW2160563446WikidataQ114214651 ScholiaQ114214651MaRDI QIDQ1154805

Pan, Victor Y.

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90009-2

zbMATH Keywords

direct sum conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Basic linear algebra (15A99)

Related Items

The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, On the order of approximation in approximative triadic decompositions of tensors, The bit-operation complexity of matrix multiplication and of all pair shortest path problem, Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication, Fast matrix multiplication and its algebraic neighbourhood, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic, Fast matrix multiplication without APA-algorithms, On the asymptotic complexity of rectangular matrix multiplication, On practical algorithms for accelerated matrix multiplication, Two new algorithms for matrix multiplication and vector convolution, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• The Computational Complexity of Continued Fractions
• New Fast Algorithms for Matrix Operations
• Partial and Total Matrix Multiplication
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• Algebras Having Linear Multiplicative Complexities
• On Obtaining Upper Bounds on the Complexity of Matrix Multiplication
• On the number of multiplications necessary to compute certain functions