Polynomial factorization through Toeplitz matrix computations

DOI10.1016/S0024-3795(02)00594-3MaRDI QIDQ1874656zbMATH OpenFDO

Authors Dario A. Bini, A. Böttcher

Publication date 25 May 2003

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0024-3795(02)00594-3

zbMATH Keywords

condition numberfinite bisection methodLaurent polynomialnumerical examplepolynomial factorizationToeplitz matrixWiener-Hopf factorization

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to single equations (65H05)

Recommendations

• Wiener-Hopf and spectral factorization of real polynomials by Newton's method
• Effective fast algorithms for polynomial spectral factorization
• scientific article; zbMATH DE number 4205876
• A Newton method for canonical Wiener-Hopf and spectral factorization of matrix polynomials
• Efficient algorithm for matrix spectral factorization

Cites work

• A Numerical Method for Locating the Zeros of an Analytic Function
• An analysis of the method of L. Fox and L. Hayes for the factorization of a polynomial
• Computations with infinite Toeplitz matrices and polynomials
• Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations
• scientific article; zbMATH DE number 1263253 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• Introduction to large truncated Toeplitz matrices
• Normabschaetzungen für die Inversen von Toeplitz-Matrizen
• Notes on the asymptotic behavior of block TOEPLITZ matrices and determinants
• On invertibility of finite sections of toeplitz matrices
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
• Solving a Polynomial Equation: Some History and Recent Progress
• Spectral fractorization of Laurent polynomials
• Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons

Cited in

(11)

• The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub
• Computations with infinite Toeplitz matrices and polynomials
• Effective fast algorithms for polynomial spectral factorization
• The Bauer-type factorization of matrix polynomials revisited and extended
• Factorization of multivariate positive Laurent polynomials
• Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox
• scientific article; zbMATH DE number 3853661 (Why is no real title available?)
• scientific article; zbMATH DE number 4205876 (Why is no real title available?)
• Wiener-Hopf and spectral factorization of real polynomials by Newton's method
• Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations
• Note on Exact Factorization Algorithm for Matrix Polynomials

This page was built for publication: Polynomial factorization through Toeplitz matrix computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1874656)