Wiener-Hopf and spectral factorization of real polynomials by Newton's method
DOI10.1016/J.LAA.2013.02.020zbMATH Open1281.65075OpenAlexW2067225260MaRDI QIDQ393389FDOQ393389
Authors: A. 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
Recommendations
- A Newton method for canonical Wiener-Hopf and spectral factorization of matrix polynomials
- scientific article; zbMATH DE number 1262457
- Effective fast algorithms for polynomial spectral factorization
- Polynomial factorization through Toeplitz matrix computations
- Efficient algorithm for matrix spectral factorization
fast algorithmNewton's methodspectral factorizationstructured matricesWiener-Hopf factorizationJacobi matrixlocal quadratic convergenceCauchy-like matrix\(LU\)-decompositiondiscrete Fourier or cosine transformpolynomial factorizationsuperfast algorithm
Toeplitz, Cauchy, and related matrices (15B05) Factorization theory (including Wiener-Hopf and spectral factorizations) of linear operators (47A68) Polynomials in real and complex fields: factorization (12D05) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- A fast solver for linear systems with displacement structure
- Title not available (Why is that?)
- Introduction to large truncated Toeplitz matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Superfast Solution of Real Positive Definite Toeplitz Systems
- Title not available (Why is that?)
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Displacement Structure: Theory and Applications
- Fast inversion of triangular Toeplitz matrices
- Algebraic methods for Toeplitz-like matrices and operators
- Fast and numerically stable algorithms for discrete cosine transforms
- Factorization of the Covariance Generating Function of a Pure Moving Average Process
- Spectral fractorization of Laurent polynomials
- A survey of spectral factorization methods
- Computations with infinite Toeplitz matrices and polynomials
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- 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?
- Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication
- Effective fast algorithms for polynomial spectral factorization
- 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
- Efficient inversion formulas for Toeplitz-plus-Hankel matrices using trigonometric transformations
- Bounding the Peak Sidelobe Level of Binary Sequences of All Lengths
- Introduction to Bézoutians
- A superfast solver for real symmetric Toeplitz systems using real trigonometric transformations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Displacement Structure Approach to Discrete-Trigonometric-Transform Based Preconditioners of G.Strang Type and of T.Chan Type
- Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations
- A fast and stable algorithm for splitting polynomials
Cited In (13)
- The Bauer-type factorization of matrix polynomials revisited and extended
- A divide and conquer method for polynomial zeros
- Newton schemes for polynomial spectral factorization: scalar case
- On the kernel structure of generalized resultant matrices
- Quasi-Toeplitz matrix arithmetic: a MATLAB toolbox
- Resultant matrices and inversion of Bézoutians
- Polynomial factorization through Toeplitz matrix computations
- A CMV-Based Eigensolver for Companion Matrices
- Computing eigenvalues of semi-infinite quasi-Toeplitz matrices
- Title not available (Why is that?)
- Numerical factorization of polynomials on the unit circle and the approximate solution of discrete Wiener-Hopf equations
- Fast and Backward Stable Computation of Roots of Polynomials
- Boundedness Behavior of the Spectral Factorization for Polynomial Data in the Wiener Algebra
Uses Software
This page was built for publication: Wiener-Hopf and spectral factorization of real polynomials by Newton's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393389)
