|
A noncommutative algorithm for multiplying $3 \times 3$ matrices using 23 multiplications
Author(s):
Julian D.
Laderman
Journal:
Bull. Amer. Math. Soc.
82
(1976),
126-128.
MSC (1970):
Primary 68A10, 65F30;
Secondary 68A20, 65H10
MathSciNet review:
0395320
Retrieve article in:
PDF
References |
Similar articles |
Additional information
References:
- 1.
- R. Brent, Algorithms for matrix multiplication, Technical Report STAN-CS-70-157, Dept. of Computer Science, Stanford Univ., 1970.
- 2.
- R. Brockett and D. Dobkin, On the number of multiplications required for matrix multiplication, SIAM J. Comput. (to appear). MR 459002
- 3.
- N. Gastinel, Sur le calcul des produits de matrices, Numer. Math. 17 (1971), 222-229. MR 45 #4616. MR 295550
- 4.
- J. Hopcroft and L. Kerr, On minimizing the number of multiplications necessary for matrix multiplication, SIAM J. Appl. Math. 20 (1971), 30-36. MR 43 #58. MR 274293
- 5.
- J. Hopcroft and J. Musinski, Duality applied to the complexity of matrix multiplication and other bilinear forms, SIAM J. Comput. 2 (1973), 159-173. MR 471439
- 6.
- I. Munro, Problems related to matrix multiplication, Proc. Courant Inst. Sympos. Computational Complexity, 1971, pp. 137-151.
- 7.
- V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969), 354-356. MR 40 #2223. MR 248973
- 8.
- S. Winograd, A new algorithm for inner product, IEEE Trans. Computers 17 (1968), 693-694.
- 9.
- S. Winograd, On multiplication of 2 x 2 matrices, Linear Algebra and Appl. 4 (1971), 381-388. MR 297115
Similar Articles:
Retrieve articles in Bulletin of the American Mathematical Society
with MSC
(1970):
68A10, 65F30, 68A20, 65H10
Retrieve articles in all Journals with MSC
(1970):
68A10, 65F30, 68A20, 65H10
Additional Information:
DOI:
10.1090/S0002-9904-1976-13988-2
PII:
S 0002-9904(1976)13988-2
|
