An improved Toeplitz algorithm for polynomial matrix null-space computation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00158290" target="_blank" >RIV/68407700:21230/09:00158290 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An improved Toeplitz algorithm for polynomial matrix null-space computation
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F06%2F0652" target="_blank" >GA102/06/0652: Software for polynomial matrix inequality optimization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Applied Mathematics and Computation
ISSN
0096-3003
e-ISSN
—
Volume of the periodical
207
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
17
Pages from-to
—
UT code for WoS article
000262613200026
EID of the result in the Scopus database
—