The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)

DOI10.3103/s027864192302005xMaRDI QIDQ6082202

No author found.

Publication date: 3 November 2023

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

objective functionalgorithms for approximate matrix multiplicationapproximate bilinear complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Numerical linear algebra (65Fxx) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• Matrix multiplication via arithmetic progressions
• Relations between exact and approximate bilinear algorithms. Applications
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
• Gaussian elimination is not optimal
• The bilinear complexity and practical algorithms for matrix multiplication
• On the complexity of some algorithms of matrix multiplication
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

This page was built for publication: The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)