A family of simultaneous methods for the determination of polynomial complex zeros
DOI10.1080/00207168208803316zbMath0483.65030OpenAlexW1969964907MaRDI QIDQ3942315
Publication date: 1982
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168208803316
numerical exampleinterval methodconvergence ordercomplex circular arithmeticsimultaneous iterative methodsdetermination of polynomial zeros
Interval and finite arithmetic (65G30) 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 (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalisation of the root iterations for polynomial complex zeros in circular interval arithmetic
- An iteration formula for the simultaneous determination of the zeros of a polynomial
- A family of root finding methods
- An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial. (An algorithm)
- A posteriori error bounds for the zeros of polynomials
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Circular arithmetic and the determination of polynomial zeros
- Zur iterativen Auflösung algebraischer Gleichungen
- A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
- Further Applications of Circular Arithmetic: Schroeder-Like Algorithms with Error Bounds for Finding Zeros of Polynomials
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- A modified Newton method for polynomials
This page was built for publication: A family of simultaneous methods for the determination of polynomial complex zeros
