Complexity of Sparse Elimination
dc.contributor.author | Bunch, James R. | en_US |
dc.date.accessioned | 2007-04-19T19:03:08Z | |
dc.date.available | 2007-04-19T19:03:08Z | |
dc.date.issued | 1973-04 | en_US |
dc.description.abstract | This paper surveys some of the recent research on the applications of the algebraic and combinatorial properties of Gaussian elimination on sparse matrices. Keywords: sparse matrix, Gaussian elimination, graph theory, computational complexity, triangulation, optimal ordering, optimum ordering, grid graph, band matrix. | en_US |
dc.format.extent | 1863244 bytes | |
dc.format.extent | 816185 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/postscript | |
dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-166 | en_US |
dc.identifier.uri | https://hdl.handle.net/1813/6012 | |
dc.language.iso | en_US | en_US |
dc.publisher | Cornell University | en_US |
dc.subject | computer science | en_US |
dc.subject | technical report | en_US |
dc.title | Complexity of Sparse Elimination | en_US |
dc.type | technical report | en_US |