Computation of the commutator of $2\times2$ matrices via five multiplications
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 48 (2008) no. 2, pp. 201-205
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
Algorithms for computing the commutator $AB$–$BA$ of $2\times2$ matrices $A$ and $B$ are proposed that involve five multiplications.
[1] Strassen V., “Gaussian elimination is not optimal”, Numer. Math., 13:4 (1969), 354–356 | DOI | MR | Zbl
[2] Hopcroft J. E., Kerr L. R., “On minimizing the number of multiplications necessary for matrix multiplication”, SIAM J. Appl. Math., 20:1 (1971), 30–36 | DOI | MR | Zbl
[3] Akho A., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979 | MR
[4] Alekseev V. B., “Slozhnost umnozheniya matrits. Obzor”, Kibernetich. sb. Novaya seriya, 25, Mir, M., 1988, 189–236 | MR