JavaScript is disabled for your browser. Some features of this site may not work without it.
Partitioning, Tearing, and Modification of Sparse Linear Systems

Author
Bunch, James R.; Rose, Donald J.
Abstract
The 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.
Date Issued
1972-11Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR72-149
Type
technical report