Wiener-Hopf and spectral factorization of real polynomials by Newton's method

DOI10.1016/j.laa.2013.02.020zbMath1281.65075OpenAlexW2067225260MaRDI QIDQ393389

Albrecht Böttcher, Martin Halwass

Publication date: 17 January 2014

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

Full work available at URL: https://doi.org/10.1016/j.laa.2013.02.020

zbMATH Keywords

spectral factorizationNewton's methodpolynomial factorizationfast algorithmWiener-Hopf factorizationJacobi matrixlocal quadratic convergenceCauchy-like matrixstructured matrices\(LU\)-decompositiondiscrete Fourier or cosine transformsuperfast algorithm

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Factorization theory (including Wiener-Hopf and spectral factorizations) of linear operators (47A68) Numerical computation of roots of polynomial equations (65H04) Toeplitz, Cauchy, and related matrices (15B05)

Related Items (8)

Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox ⋮ Computing eigenvalues of semi-infinite quasi-Toeplitz matrices ⋮ Resultant matrices and inversion of Bézoutians ⋮ Unnamed Item ⋮ The Bauer-type factorization of matrix polynomials revisited and extended ⋮ On the kernel structure of generalized resultant matrices ⋮ A CMV-Based Eigensolver for Companion Matrices ⋮ Fast and Backward Stable Computation of Roots of Polynomials

Uses Software

• na31
• drsolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast solver for linear systems with displacement structure
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
• A fast and stable algorithm for splitting polynomials
• Algebraic methods for Toeplitz-like matrices and operators
• DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication
• Are the coefficients of a polynomial well-conditioned functions of its roots?
• Introduction to large truncated Toeplitz matrices
• Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication
• Computations with infinite Toeplitz matrices and polynomials
• Spectral fractorization of Laurent polynomials
• Effective fast algorithms for polynomial spectral factorization
• Fast and numerically stable algorithms for discrete cosine transforms
• The Kantorovich theorem and interior point methods
• Polynomial factorization through Toeplitz matrix computations
• A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial
• Generalized inverses of certain Toeplitz matrices
• On computing reciprocals of power series
• Resultant matrices and inversion of Bézoutians
• An algorithm for division of powerseries
• Bounding the Peak Sidelobe Level of Binary Sequences of All Lengths
• A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations
• Superfast Solution of Real Positive Definite Toeplitz Systems
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• A survey of spectral factorization methods
• Displacement Structure: Theory and Applications
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• Displacement Structure Approach to Discrete-Trigonometric-Transform Based Preconditioners of G.Strang Type and of T.Chan Type
• Factorization of the Covariance Generating Function of a Pure Moving Average Process
• Fast inversion of triangular Toeplitz matrices
• Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations

This page was built for publication: Wiener-Hopf and spectral factorization of real polynomials by Newton's method