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
Cet article a éte moissonné depuis 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.
@article{ZVMMF_2008_48_2_a1,
author = {A. Ya. Belyankov},
title = {Computation of the commutator of $2\times2$ matrices via five multiplications},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {201--205},
year = {2008},
volume = {48},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a1/}
}
TY - JOUR AU - A. Ya. Belyankov TI - Computation of the commutator of $2\times2$ matrices via five multiplications JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 2008 SP - 201 EP - 205 VL - 48 IS - 2 UR - http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a1/ LA - ru ID - ZVMMF_2008_48_2_a1 ER -
A. Ya. Belyankov. 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. http://geodesic.mathdoc.fr/item/ZVMMF_2008_48_2_a1/
[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