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

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)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1972
Accession Number
AD0738472

Entities

People

  • M. A. Pollatchek

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Polynomials

Readers

  • Graph Algorithms and Convex Optimization.
  • Rehabilitation and Prosthetic Care for Military Service Members and Veterans with Limb Loss or Disability.