Numerical algorithms for polynomial matrices

0411142 - UTIA-B 20030129 CZ eng K - Konferenční příspěvek (tuzemská konf.)
Hromčík, Martin - Šebek, Michael
Numerical algorithms for polynomial matrices.
Praha: VŠCHT, 2002. In: Sborník příspěvků konference MATLAB 02., s. 77-78
[Seminář MATLAB 02. Praha (CZ), 07.11.2002]
Grant CEP: GA ČR GA102/02/0709
Výzkumný záměr: CEZ:AV0Z1075907
Klíčová slova: numerical algorithms * polynomial methods
Kód oboru RIV: BC - Teorie a systémy řízení

This report is devoted to new numerical methods for computations with polynomials and polynomial matrices that are encountered when solving the problems of control systems design via the algebraic methods. A distinguishing feature ofour approach is the extensive employment of the discrete Fourier transform tech-niques, namely of the famous Fast Fourier Transform routine and its relation to polynomial interpolation and Z-transform.
Trvalý link: http://hdl.handle.net/11104/0131229