Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
DOI10.1016/0096-3003(88)90136-1zbMath0659.65055OpenAlexW2062927510MaRDI QIDQ1112563
Mansor Monsi, Michael A. Wolfe
Publication date: 1988
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0096-3003(88)90136-1
comparisonnumerical examplessimple zeros of analytic functionspoint iterative proceduresrectangular complex interval arithmetic
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 (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some improvements of square root iteration for polynomial complex zeros
- An interval version of the secant method
- A note on some improvements of the simultaneous methods for determination of polynomial zeros
- Interval iteration for zeros of systems of equations
- On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic
- Some modifications of the parallel Halley iteration method and their convergence
- An algorithm for the simultaneous inclusion of real polynomial zeros
- 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
- On the convergence order of a modified method for simultaneous finding polynomial zeros
- Parallel Laguerre iterations: The complex case
- On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
- Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
- Circular arithmetic and the determination of polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- Triplex: A system for interval arithmetic
- 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
- Some modifications of Laguerre's method
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- A modified Newton method for polynomials
- Complex interval arithmetic
- Automatic errorbounds for simple zeros of analytic functions
This page was built for publication: Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros