JavaScript is disabled for your browser. Some features of this site may not work without it.
Triangular Factorization and Inversion by Fast Matrix Multiplication

Author
Bunch, James R.; Hopcroft, John E.
Abstract
The fast matrix multiplication algorithm by Strassen is used to obtain the triangular factorization of a permutation of any non-singular matrix of order n in "greater than" C sub{1}n sup{log sub{2}7} operations, and hence the inverse of any non-singular matrix in "greater than" C sub{2}n sup{log sub{2}7} operations.
Date Issued
1972-12Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-152
Type
technical report