Schröder-like algorithms for multiple complex zeros of a polynomial
From MaRDI portal
Publication:756374
DOI10.1007/BF02250583zbMath0722.65025MaRDI QIDQ756374
Publication date: 1990
Published in: Computing (Search for Journal in Brave)
algorithmsconvergencecircular arithmeticcomputational efficiencyinterval methodspolynomial equationSchröder's methodmultiple complex zero
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
Related Items (2)
The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. II: Round-off error analysis by use of interval arithmetic ⋮ The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods
Cites Work
- On the efficiency of some combined methods for polynomial complex zeros
- Some interval iterations for finding a zero of a polynomial with error bounds
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- On an iterative method for simultaneous inclusion of polynomial complex zeros
- Parallel Laguerre iterations: The complex case
- A family of root finding methods
- Iterative methods for simultaneous inclusion of polynomial zeros
- Circular arithmetic and the determination of polynomial zeros
- On Halley-Like Algorithms for Simultaneous Approximation of Polynomial Complex Zeros
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Schröder-like algorithms for multiple complex zeros of a polynomial
