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 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.