Original title: Numerical algorithms for polynomial matrices
Authors: Hromčík, Martin ; Šebek, Michael
Document type: Papers
Conference/Event: Seminář MATLAB 02, Praha (CZ), 2002-11-07
Year: 2002
Language: eng
Abstract: 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.
Keywords: numerical algorithms; polynomial methods
Project no.: CEZ:AV0Z1075907 (CEP), GA102/02/0709 (CEP)
Funding provider: GA ČR
Host item entry: Sborník příspěvků konference MATLAB 02

Institution: Institute of Information Theory and Automation AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0131229

Permalink: http://www.nusl.cz/ntk/nusl-34999


The record appears in these collections:
Research > Institutes ASCR > Institute of Information Theory and Automation
Conference materials > Papers
 Record created 2011-07-01, last modified 2024-01-26


No fulltext
  • Export as DC, NUŠL, RIS
  • Share