DocumentCode :
702071
Title :
Comparison of algorithms for computing infinite structural indices of polynomial matrices
Author :
Zuniga, J.C. ; Henrion, D.
Author_Institution :
Laboratoire d´Analyse et d´Architecture des Systèmes, Centre National de la Recherche Scientifique. 7 Avenue du Colonel Roche, 31 077 Toulouse, France
fYear :
2003
fDate :
1-4 Sept. 2003
Firstpage :
1595
Lastpage :
1600
Abstract :
A new algorithm is proposed to compute the infinite structural indices of a polynomial matrix, i.e. the algebraic and geometric multiplicities of its poles and zeros at infinity. The algorithm is based on numerically stable operations only, and takes full advantage of the block Toeplitz structure of a constant matrix built directly from the polynomial matrix coefficients. Comparative numerical examples and a full computational complexity analysis indicate that the Toeplitz algorithm can be viewed as a competitive alternative to the well-known state-space pencil matrix algorithm for obtaining structural indices.
Keywords :
Algorithm design and analysis; Complexity theory; Linear systems; MATLAB; Periodic structures; Poles and zeros; Polynomials; Polynomial matrices; computer-aided control system design; decoupling control; numerical linear algebra; structural indices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
European Control Conference (ECC), 2003
Conference_Location :
Cambridge, UK
Print_ISBN :
978-3-9524173-7-9
Type :
conf
Filename :
7085190
Link To Document :
بازگشت