Hankel-Norm Model Reduction

  • Patrick Dewilde
  • Alle-Jan van der Veen
Chapter

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.

Keywords

Interpolation Problem Hankel Operator Lyapunov Equation Hankel Matrix Elementary Rotation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Patrick Dewilde
    • 1
  • Alle-Jan van der Veen
    • 1
  1. 1.DIMESDelft University of TechnologyDelftThe Netherlands

Personalised recommendations