Factorization of analytic functions by means of Koenig's theorem and Toeplitz computations

DOI10.1007/PL00005463zbMath0990.65036OpenAlexW2032156916MaRDI QIDQ5944727

Beatrice Meini, Luca Gemignani, Dario Andrea Bini

Publication date: 18 July 2002

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00005463

zbMATH Keywords

algorithmconvergenceanalytic functionToeplitz matrixpower seriesfactorizationmatrix equationinfinite matrixblock Hessenberg formcyclic reductionpolynomial factoring

Mathematics Subject Classification ID

Power series (including lacunary series) in one complex variable (30B10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Polynomial factorization through Toeplitz matrix computations, A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial, Efficient computation of the extreme solutions of $X+A^*X^{-1}A=Q$ and $X-A^*X^{-1}A=Q$, Computations with infinite Toeplitz matrices and polynomials, Wiener-Hopf and spectral factorization of real polynomials by Newton's method, A parallel radix-4 block cyclic reduction algorithm, The cyclic reduction algorithm: From Poisson equation to stochastic processes and beyond. In memoriam of Gene H. Golub, Improvement of convergence of an iterative method for finding polynomial factors of analytic functions