Title :
New algorithm for polynomial matrix determinant based on FFT
Author :
Hromcik, M. ; Sebek, M.
Author_Institution :
Trnka Lab. for Autom. Control, Czech Tech. Univ., Prague, Czech Republic
fDate :
Aug. 31 1999-Sept. 3 1999
Abstract :
Fast Fourier Transform algorithm, the powerful technique of Discrete Fourier Transform, is used here to compute the determinant of a polynomial matrix. The new algorithm presented in the paper has been implemented in the POLYNOMIAL Toolbox for MATLAB™, Version 2.0 and its performance highly exceeds that of older procedures used in Version 1.6. The new method is both much less costly and much more reliable and also naturally handles polynomial matrices with complex coefficients. Experimental testing results are also reported in the paper.
Keywords :
fast Fourier transforms; mathematics computing; polynomial matrices; FFT; MATLAB; Polynomial Toolbox; discrete Fourier transform; fast Fourier transform; polynomial matrix determinant; Algorithm design and analysis; Discrete Fourier transforms; Interpolation; Matrices; Polynomials; Reliability; Testing; Polynomial matrix; determinant; numerical algorithms;
Conference_Titel :
Control Conference (ECC), 1999 European
Conference_Location :
Karlsruhe
Print_ISBN :
978-3-9524173-5-5
