首页> 外文会议>International workshop on computer algebra in scientific computing >Robust Schur Stability of a Polynomial Matrix Family
【24h】

Robust Schur Stability of a Polynomial Matrix Family

机译:多项式矩阵族的鲁棒Schur稳定性

获取原文

摘要

The problem of robust Schur stability of a polynomial matrix family is considered as that of discovering the structure of the stability domain in parameter space. The algorithms are proposed for establishing whether or not any given box in the parameter space belongs to this domain, and for finding the distance to instability from any internal point of the domain to its boundary. The treatment is performed in the ideology of analytical algorithm for elimination of variables and localization of zeros of algebraic systems. Some examples are given.
机译:多项式矩阵族的鲁尔Schur稳定性问题被认为是在参数空间中发现稳定域结构的问题。提出了用于确定参数空间中的任何给定框是否属于该域,以及找到从域的任何内部点到其边界到不稳定性的距离的算法。该处理以解析算法的思想进行,以消除变量和代数系统零点的定位。给出了一些例子。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号