Triangular factorization and inversion by fast matrix multiplication
James R. Bunch, John E. Hopcroft · Mathematics of Computation · 1974
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 > {C_1}{n^{{{\log }_2}7}} operations, and, hence, the inverse of any nonsingular matrix in > C 2 n log 2 7 > {C_2}{n^{{{\log }_2}7}} operations.
Cited by 329 works. doi:10.1090/s0025-5718-1974-0331751-8 Open-access PDF
Authors
References
- Matrix Iterative Analysis
- Matrix Iterative Analysis
- Gaussian elimination is not optimal
- The Theory of Matrices in Numerical Analysis.
- THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
- Computer Solution of Linear Algebraic Systems
- C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice‐Hall, Inc. Preis geb. 54 s. net