A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial
From MaRDI portal
Publication:4652860
DOI10.1080/0020716042000272511zbMath1077.65047MaRDI QIDQ4652860
No author found.
Publication date: 28 February 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020716042000272511
error bounds; Rouché's theorem; A posteriori error analysis; approximate zeros; high precision computation
30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)
65H05: Numerical computation of solutions to single equations
Cites Work
- Unnamed Item
- Inclusion of the roots of a polynomial based on Gerschgorin's theorem
- Point estimation and some applications to iterative methods
- Enclosing clusters of zeros of polynomials
- Ten methods to bound multiple roots of polynomials
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Circular arithmetic and the determination of polynomial zeros
- Simultaneous inclusion of the zeros of a polynomial
- A remark on simultaneous inclusions of the zeros of a polynomial by Gershgorin's theorem
- The fundamental theorem of algebra and complexity theory
- Solving a Polynomial Equation: Some History and Recent Progress
- Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems
- A root-finding algorithm based on Newton's method