Partitioning, Tearing, and Modification of Sparse Linear Systems.
CORNELL UNIV ITHACA N Y DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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. Author
- Theoretical Mathematics