On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
From MaRDI portal
Publication:1822456
DOI10.1007/BF01937359zbMath0618.65033OpenAlexW2053140147MaRDI QIDQ1822456
Lidija V. Stefanović, Miodrag S. Petković
Publication date: 1987
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01937359
numerical exampleConvergenceR-order of convergenceiteration formulasmultiple complex zeros of a polynomialSecond order methods
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)
Related Items
The Durand-Kerner polynomials roots-finding method in case of multiple roots, A composite polynomial zerofinding matrix algorithm, Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros, Polynomial root finding by means of continuation, Iterative methods for multiple zeros of a polynomial by clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Two observations on Durand-Kerner's root-finding method
- A note on some improvements of the simultaneous methods for determination of polynomial zeros
- On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic
- Parallel square-root iterations for multiple roots
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- Higher-order iteration functions for simultaneously approximating polynomial zeros
- On the Optimal Solution of Large Linear Systems
- An algorithm for the total, or partial, factorization of a polynomial
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
