1974/01/01 by James R. Bunch, John E. Hopcroft · 1 citation
Computer Science · Mathematics · #Cellular Automata and Applications #Interconnection Networks and Systems #Tensor decomposition and applications #Invertible matrix #Strassen algorithm #Mathematics #Permutation matrix #Factorization #Matrix multiplication #Combinatorics #Multiplication (music) #Inverse #Triangular matrix #Matrix (chemical analysis) #Inversion (geology) #LU decomposition #Matrix decomposition #Pure mathematics #Algorithm #Geometry
paper · doi:10.2307/2005828
openalex publication_date 1974/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
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 < C1n^log 27 operations, and, hence, the inverse of any nonsingular matrix in < C2n^log 27 operations.