On transformations of algorithms to multiply 2 2 matrices
From MaRDI portal
Publication:1069698
DOI10.1016/0020-0190(86)90033-5zbMATH Open0584.68058OpenAlexW2020312734MaRDI QIDQ1069698FDOQ1069698
Publication date: 1986
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(86)90033-5
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)
Cites Work
Cited In (9)
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices
- Exterior numerical radii and antiinvariant subspaces
- Nonlinear transformations of the matrix multiplication algorithm
- The least number of multiplications needed for fast multiplication of \(2\times 2\) matrices of Strassen-Winograd type
- On the synthesis of fast algorithms for signal processing
- Algorithm 898
- Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective
- Iterative refinement for defective subspaces of differential operators
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) 👍 👎
- Maximal extensions with simple multiplication for the algebra of matrices of the second order 👍 👎
- Matrix Multiplication, a Little Faster 👍 👎
- An optimal algorithm for matrix multiplication 👍 👎
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication 👍 👎
This page was built for publication: On transformations of algorithms to multiply 2\(\times 2\) matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069698)
