|
eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1813/6003
| Title: | Triangular Factorization and Inversion by Fast Matrix Multiplication |
| Authors: | Bunch, James R.
Hopcroft, John E. |
| Keywords: | computer science
technical report |
| Issue Date: | Dec-1972 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-152 |
| 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. |
| URI: | http://hdl.handle.net/1813/6003 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|
