Polynomial factorization through Toeplitz matrix computations
Publication:1874656
DOI10.1016/S0024-3795(02)00594-3zbMath1022.65052MaRDI QIDQ1874656
Dario Andrea Bini, Albrecht Böttcher
Publication date: 25 May 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
numerical examplecondition numberpolynomial factorizationToeplitz matrixWiener-Hopf factorizationLaurent polynomialfinite bisection method
Iterative numerical methods for linear systems (65F10) 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) Real polynomials: location of zeros (26C10)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Normabschaetzungen für die Inversen von Toeplitz-Matrizen
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)]
- Introduction to large truncated Toeplitz matrices
- Computations with infinite Toeplitz matrices and polynomials
- Spectral fractorization of Laurent polynomials
- An analysis of the method of L. Fox and L. Hayes for the factorization of a polynomial
- Optimal and nearly optimal algorithms for approximating polynomial zeros
- On invertibility of finite sections of toeplitz matrices
- Notes on the asymptotic behavior of block TOEPLITZ matrices and determinants
- Solving a Polynomial Equation: Some History and Recent Progress
- Using FFT-based techniques in polynomial and matrix computations: recent advances and applicatons
- A Numerical Method for Locating the Zeros of an Analytic Function
- Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations
This page was built for publication: Polynomial factorization through Toeplitz matrix computations