On bilinear complexity of multiplication of m 2 and 2 2 matrices

zbMATH Open1441.68298MaRDI QIDQ5239688FDOQ5239688

Authors: V. B. Alekseev 

Publication date: 22 October 2019

Full work available at URL: http://mathnet.ru/eng/cheb433

Recommendations

• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
• The bilinear complexity and practical algorithms for matrix multiplication
• On the approximate bilinear complexity of matrix multiplication
• On the complexity of the multiplication of matrices of small formats

zbMATH Keywords

algorithmcomplexitymatrix multiplicationbilinear complexity

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cites Work

• Gaussian elimination is not optimal
• Title not available (Why is that?)
• Matrix multiplication via arithmetic progressions
• On multiplication of 2 \(\times\) 2 matrices
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• Title not available (Why is that?)
• On the complexity of the multiplication of matrices of small formats
• 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 the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• Title not available (Why is that?)
• On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication

Cited In (20)

• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
• Equivalent polyadic decompositions of matrix multiplication tensors
• On practical algorithms for accelerated matrix multiplication
• The bilinear complexity and practical algorithms for matrix multiplication
• On the Geometry of Border Rank Algorithms for n × 2 by 2 × 2 Matrix Multiplication
• On the complexity of some algorithms of matrix multiplication
• The least number of multiplications needed for fast multiplication of \(2\times 2\) matrices of Strassen-Winograd type
• Title not available (Why is that?)
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On the arithmetic complexity of Strassen-like matrix multiplications
• An adaptive prefix-assignment technique for symmetry reduction
• On the approximate bilinear complexity of matrix multiplication
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
• Optimal evaluation of pairs of bilinear forms
• Relative bilinear complexity and matrix multiplication.
• On the complexity of the multiplication of matrices of small formats
• A lower bound for bilinear complexity of matrix multiplication over a finite field
• Title not available (Why is that?)
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25

This page was built for publication: On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239688)