A numerical procedure is proposed to solve a matrix polynomial equation frequently encountered in discrete-time control and signal processing. The algorithm is based on a simple rewriting of the original equation in terms of a reduced Sylvester matrix. In contrast to previously published methods, it does not make use of elementary polynomial operations. Moreover, and most notably, it is numerically reliable. Basic examples borrowed from control and signal processing literature are aimed at illustrating the simplicity and efficiency of this new numerical method.
References
-
-
1)
-
V. Kučera
.
Analysis and design of discrete linear control systems.
Prentice Hall Int. Ser. Syst. Control Eng.
-
2)
-
D. Henrion ,
M. Šebek
.
Symmetric matrix polynomial equation: interpolation results.
Automatica
-
3)
-
J. Ježek ,
V. Kučera
.
Efficient algorithm for matrix spectral factorization.
Automatica
,
6 ,
663 -
669
-
4)
-
J. Ježek
.
Symmetric matrix polynomial equations.
Kybernetika
,
1 ,
19 -
30
-
5)
-
P. Lancaster ,
M. Tismenetsky
.
(1985)
The theory of matrices with applications.
-
6)
-
G.H. Golub ,
C.F. Van Loan
.
(1989)
Matrix computations.
-
7)
-
P.J. Antsaklis ,
Z. Gao
.
Polynomial and rational matrix interpolation: theory andcontrol applications.
Int. J. Control
,
2 ,
349 -
404
-
8)
-
T. Kailath
.
(1980)
Linear systems.
-
9)
-
T. Söderström ,
J. Ježek ,
V. Kučera
.
An efficient and versatile algorithm for computingthe covariance function of an ARMA process.
IEEE Trans. Signal Process.
,
6 ,
1591 -
1600
-
10)
-
Kwakernaak, H., Šebek, M.: `The polynomial toolbox for MATLAB, Version 1.5', 1997, Available as freeware on the Internet at http://www.math.utwente.nl/polbox/.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cta_19982232
Related content
content/journals/10.1049/ip-cta_19982232
pub_keyword,iet_inspecKeyword,pub_concept
6
6