On the complexity of some algorithms of matrix multiplication

DOI10.1016/0196-6774(85)90019-7MaRDI QIDQ3698315zbMATH OpenOpenAlexFDO

Authors V. B. Alekseev

Publication date 1985

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(85)90019-7

zbMATH Keywords

multiplication of matrices over arbitrary fields

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• An optimal algorithm for matrix multiplication
• On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
• On the additive complexity of 2 \(\times 2\) matrix multiplication
• A Lower Bound for Matrix Multiplication
• Fast rectangular matrix multiplication and applications

Cited in

(35)

• Semisimple algebras of almost minimal rank over the reals
• Complexities of special matrix multiplication problems
• The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented algorithms
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
• A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
• An introduction to the computational complexity of matrix multiplication
• On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field
• New ways to multiply \(3 \times 3\)-matrices
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
• On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
• On the fraction of matrices with maximal additive complexity
• The least number of multiplications needed for fast multiplication of 2 2 matrices of Strassen-Winograd type
• The bilinear complexity and practical algorithms for matrix multiplication
• Algorithm 898
• scientific article; zbMATH DE number 4018239 (Why is no real title available?)
• Geometry and the complexity of matrix multiplication
• Relative bilinear complexity and matrix multiplication.
• scientific article; zbMATH DE number 4024638 (Why is no real title available?)
• Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
• scientific article; zbMATH DE number 1042590 (Why is no real title available?)
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• scientific article; zbMATH DE number 7272516 (Why is no real title available?)
• Optimization techniques for small matrix multiplication
• scientific article; zbMATH DE number 6412845 (Why is no real title available?)
• On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
• Multiplying matrices faster than coppersmith-winograd
• scientific article; zbMATH DE number 7650266 (Why is no real title available?)
• An adaptive prefix-assignment technique for symmetry reduction
• The approximate bilinear complexity of the multiplication of matrices of sizes \(2\times n\) and \(n\times 4\)
• Computation of the commutator of 2 × 2 matrices via six multiplications
• A lower bound for bilinear complexity of matrix multiplication over a finite field
• On the additive complexity of 2 \(\times 2\) matrix multiplication
• Stability improvements for fast matrix multiplication
• On the automorphism group of a possible short algorithm for multiplying 3 3 matrices
• Faster search for tensor decomposition over finite fields

This page was built for publication: On the complexity of some algorithms of matrix multiplication

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