Triangular factorization and inversion by fast matrix multiplication
Abstract: The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any nonsingular matrix of order n in operations, and, hence, the inverse of any nonsingular matrix in operations.
-  George E. Forsythe and Cleve B. Moler, Computer solution of linear algebraic systems, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1967. MR 0219223
-  Alston S. Householder, The theory of matrices in numerical analysis, Blaisdell Publishing Co. Ginn and Co. New York-Toronto-London, 1964. MR 0175290
-  Volker Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969), 354–356. MR 0248973, https://doi.org/10.1007/BF02165411
-  Richard S. Varga, Matrix iterative analysis, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1962. MR 0158502
-  S. Winograd, Private communication.
- G. E. Forsythe & C. B. Moler, Computer Solution of Linear Algebraic Equations, Prentice-Hall, Englewood Cliffs, N.J., 1967. MR 36 #2306. MR 0219223 (36:2306)
- A. S. Householder, The Theory of Matrices in Numerical Analysis, Blaisdell, New York, 1964. MR 30 #5475. MR 0175290 (30:5475)
- V. Strassen, "Gaussian elimination is not optimal," Numer. Math., v. 13, 1969, pp. 354-356. MR 40 #2223. MR 0248973 (40:2223)
- R. S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, N.J., 1962. MR 28 #1725. MR 0158502 (28:1725)
- S. Winograd, Private communication.
Retrieve articles in Mathematics of Computation with MSC: 65F30
Retrieve articles in all journals with MSC: 65F30
Keywords: LU decomposition, Strassen's method, fast matrix inversion, linear equations, Gaussian elimination, computational complexity
Article copyright: © Copyright 1974 American Mathematical Society