A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices

DOI10.1134/S0965542515040168zbMath1331.68296MaRDI QIDQ2354472

Yanyan Li

Publication date: 13 July 2015

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

matrix multiplicationbilinear complexitybilinear algorithmapproximate bilinear algorithmfast algorithm for multiplying matriceslength of algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items

The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\), Symmetric matrices whose entries are linear functions, On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication

Cites Work

• Unnamed Item
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On the approximate bilinear complexity of matrix multiplication
• 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
• On the complexity of the multiplication of matrices of small formats
• Gaussian elimination is not optimal
• On multiplication of 2 \(\times\) 2 matrices
• The bilinear complexity and practical algorithms for matrix multiplication
• On the complexity of some algorithms of matrix multiplication
• Partial and Total Matrix Multiplication
• Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication