Accession Number:

AD0749945

Title:

Toward Characterization of Perfect Elimination Digraphs.

Descriptive Note:

Research rept.,

Corporate Author:

DENVER UNIV COLO DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1972-01-01

Pagination or Media Count:

21.0

Abstract:

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

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE