Triangular Factorization and Inversion by Fast Matrix Multiplication
- 1 January 1974
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 28 (125) , 231-236
- https://doi.org/10.2307/2005828
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 $< {C_1}{n^{{{\log }_2}7}}$ operations, and, hence, the inverse of any nonsingular matrix in $< {C_2}{n^{{{\log }_2}7}}$ operations.
Keywords
This publication has 2 references indexed in Scilit:
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- The Theory of Matrices in Numerical Analysis.The American Mathematical Monthly, 1966