On the approximate bilinear complexity of matrix multiplication

DOI10.3103/S0278641914030078zbMath1328.65102MaRDI QIDQ891131

A. P. Trefilov

Publication date: 16 November 2015

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

zbMATH Keywords

bilinear algorithmsapproximate algorithmsmatrix multiplicationbilinear complexitymatrix tensors

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Refining the upper bound for the cardinality of the definition domain of universal functions for a class of linear Boolean functions ⋮ A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices

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
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Gaussian elimination is not optimal
• The bilinear complexity and practical algorithms for matrix multiplication

This page was built for publication: On the approximate bilinear complexity of matrix multiplication