Cart (Loading....) | Create Account
Close category search window

On come computational aspects of the factorization algorithm of an elementary paraconjugate Hermitian polynomial matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pollatschek, M.A. ; Technion-Israel Institute of Technology, Haifa, Israel

Through appropriate formulation of a step in the factorization algorithm of an elementary paraconjugate Hermitian polynomial matrix, the exponential time bound for this step is reduced to a low-order polynomial. As the remaining steps have a bound of the same type, considerable time-saving is entailed in larger problems. The procedure utilizes the fact that the relevant matrix may be viewed as the incidence matrix of a bipartite graph. The reduction involves finding the strongly connected components of the graph, resulting from the solution of an assignment problem.

Published in:

Automatic Control, IEEE Transactions on  (Volume:19 ,  Issue: 4 )

Date of Publication:

Aug 1974

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.