Toward Characterization of Perfect Elimination Digraphs.
DENVER UNIV COLO DEPT OF MATHEMATICS
Pagination or Media Count:
Perfect elimination digraphs arise in the study of Gaussian elimination on sparse linear systems. With a view to numerical computational complexity the authors show four conditions C1-C4 to be necessary for the perfect elimination property. The sufficiency of C1 is shown and the sufficiency of C2-C4 is shown in the symmetric case. The authors conjecture the sufficiency of C2, C3 in the general case. Author
- Theoretical Mathematics