Toward Characterization of Perfect Elimination Digraphs.

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)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1972
Accession Number
AD0749945

Entities

People

  • Donald J. Rose
  • Loren Haskins

Organizations

  • University of Denver

Tags

DTIC Thesaurus Topics

  • Computational Complexity
  • Elimination
  • Linear Systems

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Approximation Theory.
  • Electrochemical Engineering/ Fuel Cell Technologies

Technology Areas

  • Fully Networked C3
  • Fully Networked C3 - Command and Control