.png){kind=icon}
返回
An improved Toeplitz algorithm for polynomial matrix null-space computation
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2008.10.037.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an improved algorithm to compute the minimal null-space basis of polynomial matrices, a problem which has many applications in control and systems theory. This algorithm takes advantage of the block Toeplitz structure of the Sylvester matrix associated with the polynomial matrix. The analysis of algorithmic complexity and numerical stability shows that the algorithm is reliable and can be considered as an efficient alternative to the well-known pencil (state-space) algorithms found in the literature. (C) 2008 Elsevier Inc. All rights reserved.
Keyword:
Polynomial matrices
Numerical linear algebra
Computer-aided control system design
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
Synthesis, spectroscopic, and biological studies of novel estolides derived from anticancer active 4‐O‐podophyllotoxinyl 12‐hydroxyl‐octadec‐Z‐9‐enoate.png)
Lipids
LipidsIF0
PREAI
分享收藏
分享收藏
查看更多内容