Discrete-time symmetric polynomial equations with complex coefficients
Didier Henrion; Jan Ježek; Michael Šebek
Kybernetika (2002)
- Volume: 38, Issue: 2, page [113]-139
- ISSN: 0023-5954
Access Full Article
top
Abstract
topHow to cite
topHenrion, Didier, Ježek, Jan, and Šebek, Michael. "Discrete-time symmetric polynomial equations with complex coefficients." Kybernetika 38.2 (2002): [113]-139. <http://eudml.org/doc/33571>.
@article{Henrion2002,
abstract = {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 reduction algorithms 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.},
author = {Henrion, Didier, Ježek, Jan, Šebek, Michael},
journal = {Kybernetika},
keywords = {polynomial equation; Sylvester matrix; dynamical system; polynomial equation; Sylvester matrix; dynamical system},
language = {eng},
number = {2},
pages = {[113]-139},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Discrete-time symmetric polynomial equations with complex coefficients},
url = {http://eudml.org/doc/33571},
volume = {38},
year = {2002},
}
TY - JOUR
AU - Henrion, Didier
AU - Ježek, Jan
AU - Šebek, Michael
TI - Discrete-time symmetric polynomial equations with complex coefficients
JO - Kybernetika
PY - 2002
PB - Institute of Information Theory and Automation AS CR
VL - 38
IS - 2
SP - [113]
EP - 139
AB - 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 reduction algorithms 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.
LA - eng
KW - polynomial equation; Sylvester matrix; dynamical system; polynomial equation; Sylvester matrix; dynamical system
UR - http://eudml.org/doc/33571
ER -
References
top- Barmish B. R., New Tools for Robustness of Linear Systems, MacMillan, New York 1994 Zbl1094.93517
- Bose N. K., Shi Y. Q., 10.1109/TCS.1987.1086055, IEEE Trans. Circuits and Systems 34 (1987), 1233–1237 (1987) Zbl0643.93057MR0908562DOI10.1109/TCS.1987.1086055
- Golub G. H., Loan C. F. Van, Matrix Computations, Third edition. Johns Hopkins University Press, Baltimore, Maryland 1996 MR1417720
- Henrion D., Šebek M., An efficient numerical method for the discrete-time symmetric matrix polynomial equation, IEE Proceedings, Control Theory and Applications 145 (1998), 5, 443–448 (1998)
- Henrion D., Reliable Algorithms for Polynomial Matrices, Ph. D. Thesis, Control Theory Department, Institute of Information Theory and Automation, Prague 1998
- Henrion D., Šebek M., 10.1016/S0005-1098(98)00029-6, Automatica 34 (1998), 7, 811–824 (1998) Zbl0935.65042MR1635080DOI10.1016/S0005-1098(98)00029-6
- Henrion D., Šebek M., 10.1109/9.751344, IEEE Trans. Automat. Control 44 (1999), 3, 497–508 (1999) Zbl0956.65036MR1680274DOI10.1109/9.751344
- Higham N. J., Accuracy and Stability of Numerical Algorithms, SIAM, Philadelphia 1996 Zbl1011.65010MR1368629
- Ježek J., Conjugated and symmetric polynomial equations, Part II: Discrete-time systems. Kybernetika 19 (1983), 3, 196–211 (1983) Zbl0556.93044MR0716649
- Ježek J., Kučera V., 10.1016/0005-1098(85)90040-8, Automatica 21 (1985), 6, 663–669 (1985) MR0818806DOI10.1016/0005-1098(85)90040-8
- Ježek J., Symmetric matrix polynomial equations, Kybernetika 22 (1986), 1, 19–30 (1986) Zbl0599.93008MR0839342
- Ježek J., Hunt K. J., 10.1080/00207179308923047, Internat. J. Control 58 (1993), 5, 1155–1167 (1993) MR1242443DOI10.1080/00207179308923047
- Kailath T., Linear Systems, Prentice Hall, Englewood Cliffs, N.J. 1980 Zbl0870.93013MR0569473
- Kučera V., Discrete Linear Control: The Polynomial Approach, Wiley, Chichester 1979 MR0573447
- Kučera V., Analysis and Design of Discrete Linear Control Systems, Prentice Hall, London 1991 Zbl0762.93060MR1182311
- Lindbom L., A Wiener Filtering Approach to the Design of Tracking Algorithms with Applications to Mobile Radio Communications, Ph. D. Thesis, Signal Processing Group, Department of Technology, Uppsala University, Sweden 1995
- MacChi O., Adaptive Processing: the Least Mean Squares Approach and Applications in Transmission, Wiley, Chichester 1995
- Proakis J. G., Salehi M., Communication Systems Engineering, Prentice Hall, Englewood Cliffs, N.J. 1994 Zbl0864.94001
- Šebek M., Kwakernaak H., Henrion, D., Pejchová S., Recent Progress in Polynomial Methods and Polynomial Toolbox for Matlab Version 2, 0. In: Proc. Conference on Decision and Control, IEEE, Tampa 1998, pp. 3661–3668.See also the web page www.polyx.com (1998)
- Söderström T., Ježek, J., Kučera V., 10.1109/78.678473, IEEE Trans. Signal Processing 46 (1998), 6, 1591–1600 (1998) Zbl1028.93031MR1667256DOI10.1109/78.678473
- Willems J. C., Trentelman H. L., 10.1137/S0363012996303062, SIAM J. Control Optim. 36 (1998), 5, 1703–1749 (1998) Zbl0912.93006MR1626821DOI10.1137/S0363012996303062
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.