Effective fast algorithms for polynomial spectral factorization

DOI10.1023/B:NUMA.0000005364.00003.eazbMath1035.65047OpenAlexW2003412314WikidataQ60359708 ScholiaQ60359708MaRDI QIDQ1418838

Dario Andrea Bini, Giuseppe Fiorentino, Beatrice Meini, Luca Gemignani

Publication date: 14 January 2004

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:numa.0000005364.00003.ea

zbMATH Keywords

convergencespectral factorizationnumerical experimentspolynomial factorizationGraeffe methodLaurent polynomial inversionthe Toeplitz matrix

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items

Semi-infinite quasi-Toeplitz matrices with applications to QBD stochastic processes, A note on backward prediction for multivariate ARMA processes, Wiener-Hopf and spectral factorization of real polynomials by Newton's method, A parallel radix-4 block cyclic reduction algorithm, On the acceleration of an algorithm for polynomial factorization, Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox, Computing eigenvalues of semi-infinite quasi-Toeplitz matrices, Moving Average Representations for Multivariate Stationary Processes, Bauer's spectral factorization method for low order multiwavelet filter design, The Bauer-type factorization of matrix polynomials revisited and extended, On Hurwitz stable polynomials with integer coefficients, The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub, Fast solution of unsymmetric banded Toeplitz systems by means of spectral factorizations and Woodbury's formula, A CMV-Based Eigensolver for Companion Matrices, Fast and Backward Stable Computation of Roots of Polynomials