The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations

DOI10.1016/0304-3975(84)90107-5zbMath0551.68040OpenAlexW2119174323MaRDI QIDQ800727

Pan, Victor Y.

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90107-5

zbMATH Keywords

arithmetic complexitymatrix multiplicationdirect sumtensor rankstrilinear aggregating

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items

Fast matrix multiplication and its algebraic neighbourhood

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to multiply matrices faster
• On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
• 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
• Fast matrix multiplication without APA-algorithms
• The complexity of partial derivatives
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• On the computational power of pushdown automata
• New Fast Algorithms for Matrix Operations
• Partial and Total Matrix Multiplication
• Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
• On the Asymptotic Complexity of Matrix Multiplication
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms