Discrete-time symmetric polynomial equations with complex coefficients

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reductionalgorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for MATLAB.

[1]  Michael Sebek,et al.  An efficient numerical method for the discrete time symmetric matrix polynomial equation , 1997, 1997 European Control Conference (ECC).

[2]  李幼升,et al.  Ph , 1989 .

[3]  Masoud Salehi,et al.  Communication Systems Engineering , 1994 .

[4]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[5]  Harry L. Trentelman,et al.  On quadratic differential forms , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[6]  Michael Sebek,et al.  Symmetric Matrix Polynomial Equation: Interpolation Results , 1998, Autom..

[7]  Michael Sebek,et al.  Reliable numerical methods for polynomial matrix triangularization , 1999, IEEE Trans. Autom. Control..

[8]  Odile Macchi,et al.  Adaptive Processing: The Least Mean Squares Approach with Applications in Transmission , 1995 .

[9]  K. J. Hunt,et al.  Coupled polynomial equations for LQ control synthesis and an algorithm for solution , 1993 .

[10]  Jan Jezek.  Conjugated and symmetric polynomial equations. II. Discrete-time systems , 1983, Kybernetika.

[11]  I. VÁŇOVÁ,et al.  Academy of Sciences of the Czech Republic , 2020, The Grants Register 2021.

[12]  D. Henrion,et al.  Efficient numerical method for the discrete-time symmetric matrix polynomial equation , 1998 .

[13]  Vladimír Kučera,et al.  Analysis and design of discrete linear control systems , 1991 .

[14]  Gene H. Golub,et al.  Matrix Computations, Third Edition , 1996 .

[15]  D. Henrion,et al.  Reliable Algorithms for Polynomial Matrices , 1998 .

[16]  Torsten Söderström,et al.  An efficient and versatile algorithm for computing the covariance function of an ARMA process , 1998, IEEE Trans. Signal Process..

[17]  J. Jeek,et al.  Paper: Efficient algorithm for matrix spectral factorization , 1985 .

[18]  B. Ross Barmish,et al.  New Tools for Robustness of Linear Systems , 1993 .

[19]  Jan Jezek.  Symmetric matrix polynomial equations , 1986, Kybernetika.

[20]  Lars Lindbom.  A Wiener filtering approach to the design of tracking algorithms : with applications in mobile radio communications , 1995 .

[21]  Nirmal Kumar Bose,et al.  A simple general proof of Kharitonov's generalized stability criterion , 1987 .

[22]  Vladimír Kucera,et al.  Efficient algorithm for matrix spectral factorization , 1985, Autom..

[23]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .