Partitioning, Tearing, and Modification of Sparse Linear Systems.

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. (Author)

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1972
Accession Number
AD0753022

Entities

People

  • Donald J. Rose
  • James R. Bunch

Organizations

  • Department of Computer Science, Cornell University

Tags

DTIC Thesaurus Topics

  • Computational Complexity
  • Elimination
  • Linear Systems
  • Mathematics
  • Sparse Matrix

Readers

  • Materials Science (Mechanical Engineering).
  • Operations Research