Polynomial computation of Hankel singular values


Kwakernaak, Huibert (1992) Polynomial computation of Hankel singular values. In: 31st IEEE Conference on Decision and Control, December 1992, Tucson, Arizona (pp. pp. 3595-3599).

open access
Abstract:A revised and improved version of a polynomial algorithm is presented. It was published by N.J. Young (1990) for the computation of the singular values and vectors of the Hankel operator defined by a linear time-invariant system with a rotational transfer matrix. Tentative numerical experiments indicate that for high-order systems, scaling of the polynomial matrices N and D (so that the constant and leading coefficient matrices are of the same order of magnitude) is mandatory, and that solution of bilateral linear polynomial matrix equations by coefficient expansion is highly inefficient
Item Type:Conference or Workshop Item
Copyright:© 1992 IEEE
Link to this item:http://purl.utwente.nl/publications/30891
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 141532