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

摘要

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)