.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Polynomial matrices
Numerical linear algebra
Computer-aided control system design
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
Cited Papers
ShareSaveSynthesis, spectroscopic, and biological studies of novel estolides derived from anticancer active 4‐O‐podophyllotoxinyl 12‐hydroxyl‐octadec‐Z‐9‐enoate.png)
Lipids
LipidsIF0
PREAI
ShareSaveShareSave
ShareSave
View more