On transformations of algorithms to multiply 2\(\times 2\) matrices

DOI10.1016/0020-0190(86)90033-5zbMath0584.68058OpenAlexW2020312734MaRDI QIDQ1069698

Philippe Chatelin

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

zbMATH Keywords

program transformationalgebraic complexitymatrix multiplicationsets of bilinear forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Algorithms in computer science (68W99)

Related Items (4)

Exterior numerical radii and antiinvariant subspaces ⋮ Iterative refinement for defective subspaces of differential operators ⋮ Strassen's \(2 \times 2\) matrix multiplication algorithm: a conceptual perspective ⋮ On the synthesis of fast algorithms for signal processing

Cites Work

• How to multiply matrices faster
• On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
• Gaussian elimination is not optimal

This page was built for publication: On transformations of algorithms to multiply 2\(\times 2\) matrices