One-step extension approach to optimal Hankel-norm approximation and H-optimization problems

Ciann-Dong Yang, Fang Bo Yeh

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)

Abstract

A novel methodology for Hankel approximation and H-optimization problems is presented, based on a new formulation of the Adamjan-Arov-Krein one-step extension problem. The problem is solved by the Sarason interpolation theorem. The parametrization of all optimal solutions is given in terms of the eigenvalue decomposition of a Hermitian matrix composed directly from the coefficients of the given transfer function matrix. The proposed method does not require an initial balanced realization; nevertheless, the method itself provides a very simple, natural wayt to achieve this. In the present method, if one obtains the minimal balanced realization of a given transfer function matrix, then one also obtains the Hankel approximants of that transfer function at the same time.

Original languageEnglish
Pages (from-to)2622-2627
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume5
Publication statusPublished - 1990 Dec 1
EventProceedings of the 29th IEEE Conference on Decision and Control Part 5 (of 6) - Honolulu, HI, USA
Duration: 1990 Dec 51990 Dec 7

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'One-step extension approach to optimal Hankel-norm approximation and H<sup>∞</sup>-optimization problems'. Together they form a unique fingerprint.

Cite this