Abstract
A new graph-theoretic algorithm based on the hungarian method of Kuhn [4] is introduced for the determination of the number of invariant zeros of large scale systems. The execution time of a program based on this algorithm is compared with that of the program ZEROS developed by Emami-Naeini and Van Dooren in [3] for the determination of invariant zeros of numerical systems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
