On transformations of algorithms to multiply 2\(\times 2\) matrices (Q1069698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On transformations of algorithms to multiply 2 2 matrices |
scientific article; zbMATH DE number 3936515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On transformations of algorithms to multiply 2\(\times 2\) matrices |
scientific article; zbMATH DE number 3936515 |
Statements
On transformations of algorithms to multiply 2\(\times 2\) matrices (English)
0 references
1986
0 references
Representing these algorithms by noncommutative polynomials, we construct first the optimal algorithm of Winograd. Then, using an invariant transformation - in the algebraic sense - we transform this algorithm into the algorithm of Strassen. Follow remarks on this family of algorithms.
0 references
program transformation
0 references
algebraic complexity
0 references
sets of bilinear forms
0 references
matrix multiplication
0 references
0.798867404460907
0 references
0.7970786094665527
0 references
0.7960246205329895
0 references
0.7818626165390015
0 references
