Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
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
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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
72-152.pdf531.64 kBAdobe PDFView/Open
72-152.ps314.69 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us