首页> 外文会议>IEEE Conference on Decision and Control >One-step extension approach to optimal Hankel-norm approximation and H/sup infinity /-optimization problems
【24h】

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

机译:最佳Hankel-Norm逼近和H / SUP无限/ - 优化问题的一步扩展方法

获取原文

摘要

A methodology for Hankel approximation and H/sup infinity /-optimization problems is presented, based on a formulation of the one-step extension problem of V.M. Adamjan, D.Z. Arov and M.G. Krein (1971). The problem is solved by the interpolation theorem of D. Sarason (1976). 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 way to achieve this. In the method, if the minimal balanced realization of a given transfer function matrix is obtained, then the Hankel approximants of that transfer function are obtained at the same time.
机译:基于V.M的一步延伸问题的制定,提出了一种用于Hankel近似和H / SUP无限/ - 优化问题的方法。 Adamjan,D.Z. arov和m.g.凯琳(1971)。问题由D. Sarason(1976)的插值定理解决。就直接由给定传递函数矩阵的系数组成的密封矩阵的特征值分解而言,给出了所有最佳解决方案的参数化。所提出的方法不需要初始平衡实现;然而,该方法本身提供了一种实现这一目标的非常简单,自然的方式。在该方法中,如果获得给定传递函数矩阵的最小平衡实现,则同时获得该传递函数的Hankel近似剂。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号