Show simple item record

dc.contributor.authorBunch, James R.en_US
dc.contributor.authorRose, Donald J.en_US
dc.date.accessioned2007-04-19T18:29:48Z
dc.date.available2007-04-19T18:29:48Z
dc.date.issued1972-11en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-149en_US
dc.identifier.urihttps://hdl.handle.net/1813/6000
dc.description.abstractThe computational complexity of partitioning sparse matrices is developed graph-theoretically. The results are used to study tearing and modification, and to show that single-element tearing of symmetric systems is rarely advantageous when the torn system is solved by elimination.en_US
dc.format.extent1773224 bytes
dc.format.extent478133 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titlePartitioning, Tearing, and Modification of Sparse Linear Systemsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics