首页> 外文会议>International Symposium on Test Automation Instrumentation >Calculating Greatest Common Divisor of N Polynomials and Judging Stability of Linear System with Constant Complex Coefficients through Matrix Transformation
【24h】

Calculating Greatest Common Divisor of N Polynomials and Judging Stability of Linear System with Constant Complex Coefficients through Matrix Transformation

机译:通过矩阵变换计算N多项式N多项式的最大常见分配和恒定复合系数的线性系统稳定性

获取原文

摘要

This paper proved a theorem about a new algorithm for calculating the greatest common divisor of many polynomials, the algorithm improved and developed Euclid's algorithm in algebra. The paper gives a new method for judging stability of linear system with constant complex coefficients through matrix transformation, it improve Hurwitz algorithm.
机译:本文证明了一种关于计算许多多项式的最大常见除数的新算法,该算法改进和开发了代数的EuclID算法。 本文通过矩阵变换,提供了一种判断线性系统稳定性的新方法,通过矩阵变换,提高了Hurwitz算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号