eCommons

 

Complexity of Sparse Elimination

dc.contributor.authorBunch, James R.en_US
dc.date.accessioned2007-04-19T19:03:08Z
dc.date.available2007-04-19T19:03:08Z
dc.date.issued1973-04en_US
dc.description.abstractThis 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.extent1863244 bytes
dc.format.extent816185 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-166en_US
dc.identifier.urihttps://hdl.handle.net/1813/6012
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleComplexity of Sparse Eliminationen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
73-166.pdf
Size:
1.78 MB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
73-166.ps
Size:
797.06 KB
Format:
Postscript Files