Accession Number:

AD0738472

Title:

On Some Computational Aspects of Elementary Para-Conjugate Hermitian Polynomial Matrix-Factorization Algorithm.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF OPERATIONS RESEARCH HOUSE

Personal Author(s):

Report Date:

1972-02-01

Pagination or Media Count:

32.0

Abstract:

By proper formulation of a step in the factorization algorithm of an elementary paraconjugate Hermitian polynomial matrix the exponential time-bound can be reduced to low polynomial one. As the remaining steps have polynomial time-bound a big save is expected in larger problems. The reduction is possible by finding the strongly-connected components of the graph resulting from the solution of an assignment problem. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE