Fast matrix multiplication without APA-algorithms

DOI10.1016/0898-1221(82)90029-3zbMath0492.65025OpenAlexW1967072888MaRDI QIDQ1168050

Pan, Victor Y.

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0898-1221(82)90029-3

zbMATH Keywords

linear transformationsfast matrix multiplicationStrassen's algorithmgenerating tablesmethod of trilinear aggregatingmethods of APA-algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Fast matrix multiplication and its algebraic neighbourhood, 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
• Relations between exact and approximate bilinear algorithms. Applications
• New combinations of methods for the acceleration of matrix multiplication
• Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
• On the optimal evaluation of a set of bilinear forms
• \(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
• On the Asymptotic Complexity of Matrix Multiplication
• Algebras Having Linear Multiplicative Complexities