arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.13101math.NAcs.NA
收藏

近似矩阵多项式GCD减少数据不确定性的广义算法及其在MIMO系统和控制中的应用

Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control

A. Fazzi, N. Guglielmi, I. Markovsky

摘要:

多项式(近似)公共因子的计算是控制理论和信号处理等科学领域中的一个重要问题。虽然这个问题已经被广泛研究的标量多项式,在矩阵多项式的框架内的科学文献似乎是有限的问题,确切的最大公因数计算。本文将两个算法从标量推广到矩阵多项式。第一个是快速和简单。第二个更准确,但计算成本更高。我们测试了这两种算法的性能,并观察到类似的行为,在标量的情况下。最后,我们描述了多输入多输出线性时不变动力系统的应用。

英文摘要:

Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific literature in the framework of matrix polynomials seems to be limited to the problem of exact greatest common divisors computation. In this paper, we generalize two algorithms from scalar to matrix polynomials. The first one is fast and simple. The second one is more accurate but computationally more expensive. We test the performances of the two algorithms and observe similar behavior to the one in the scalar case. Finally we describe an application to multi-input multi-output linear time-invariant dynamical systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑