Numerical Algorithms for Polynomial Plus/Minus Factorization

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03133188" target="_blank" >RIV/68407700:21230/07:03133188 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Numerical Algorithms for Polynomial Plus/Minus Factorization
Original language description
Two new algorithms are presented in the paper for the plus/minus factorization of a scalar discrete-time polynomial. The first method is based on the discrete Fourier transform theory (DFT) and its relationship to the Z-transform. Involving DFT computational techniques and the famous fast Fourier transform routine brings high computational efficiency and reliability. The method is applied in the case study of H2-optimal inverse dynamic filter to an audio equipment. The second numerical procedure originates in a symmetric spectral factorization routine, namely the Bauer's method of the 1950s. As a by-product, a recursive LU factorization procedure for Toeplitz matrices is devised that is of more general impact and can be of use in other areas of appliedmathematics as well. Performance of the method is demonstrated by an l1 optimal controller design example.
Czech name
Numerické algoritmy pro polynomiální plus-minus faktorizaci.
Czech description
Článek popisuje dva nové numerické algoritmy pro polynomiální plus-minus faktorizaci.

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BC - Theory and management systems
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)