On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
type: Item
instance of: scholarly article
title: On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
zbMATH Open document ID: 1317.68061
DOI: 10.1134/S0081543813070079
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Proceedings of the Steklov Institute of Mathematics
publication date: 2014-12-16T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6380775
MaRDI profile type: Publication
cites work: Gaussian elimination is not optimal
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3816908
cites work: Relations between exact and approximate bilinear algorithms. Applications
cites work: On multiplication of 2 \(\times\) 2 matrices
cites work: A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
cites work: On the complexity of the multiplication of matrices of small formats
cites work: Partial and Total Matrix Multiplication
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
cites work: On the complexity of some algorithms of matrix multiplication
cites work: On Winograd's Algorithm for Inner Products
cites work: Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
full work available at URL: s0081543813070079
OpenAlex ID: W1964758312
Recommended article: The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
Recommended article: Q5239688
Recommended article: On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
Recommended article: On the approximate bilinear complexity of matrix multiplication
Recommended article: The bilinear complexity and practical algorithms for matrix multiplication
Recommended article: On the additive complexity of 2 \(\times 2\) matrix multiplication
Recommended article: Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
Recommended article: Relative bilinear complexity and matrix multiplication.
Recommended article: A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
Recommended article: On the complexity of some algorithms of matrix multiplication
description: scientific article; zbMATH DE number 6380775