Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Triangular factorization and inversion by fast matrix multiplication


Authors: James R. Bunch and John E. Hopcroft
Journal: Math. Comp. 28 (1974), 231-236
MSC: Primary 65F30
DOI: https://doi.org/10.1090/S0025-5718-1974-0331751-8
MathSciNet review: 0331751
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F30

Retrieve articles in all journals with MSC: 65F30


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1974-0331751-8
Keywords: LU decomposition, Strassen's method, fast matrix inversion, linear equations, Gaussian elimination, computational complexity
Article copyright: © Copyright 1974 American Mathematical Society