Abstract
In the previous chapters, we assumed that a given upper operator or matrix T has a computational model of a sufficiently low order to warrant the (possibly expensive) step of deriving its state realization. Once a state model is known, we showed how multiplication by T or its inverse can be done efficiently, using the model rather than the entries of T. We also derived some useful factorizations, such as the external and inner-outer (~ QR) factorization. A spectral factorization/Cholesky factorization result is given in chapter 13.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Dewilde, P., van der Veen, AJ. (1998). Hankel-Norm Model Reduction. In: Time-Varying Systems and Computations. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2817-0_10
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2817-0_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5045-1
Online ISBN: 978-1-4757-2817-0
eBook Packages: Springer Book Archive