On Some Computational Aspects of Elementary Para-Conjugate Hermitian Polynomial Matrix-Factorization Algorithm
Author | : M. A. Pollatchek |
Publisher | : |
Total Pages | : 32 |
Release | : 1972 |
ISBN-10 | : OCLC:227659587 |
ISBN-13 | : |
Rating | : 4/5 ( Downloads) |
Download or read book On Some Computational Aspects of Elementary Para-Conjugate Hermitian Polynomial Matrix-Factorization Algorithm written by M. A. Pollatchek and published by . This book was released on 1972 with total page 32 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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).