On comparison of annuli containing all the zeros of a polynomial
From MaRDI portal
Publication:5034286
Recommendations
Cites work
- scientific article; zbMATH DE number 1820648 (Why is no real title available?)
- scientific article; zbMATH DE number 836627 (Why is no real title available?)
- scientific article; zbMATH DE number 5035437 (Why is no real title available?)
- A highly efficient root-solver of very fast convergence
- A modified Newton method for polynomials
- An annulus for the zeros of polynomials
- An annulus for the zeros of polynomials
- An improvement on two iteration methods for simultaneous determination of the zeros of a polynomial
- Annulus containing all the zeros of a polynomial
- Bounds for the moduli of zeros.
- Bounds on the moduli of polynomial zeros
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- Note on bounds of the zeros
- On annuli containing all the zeros of a polynomial
- On annulus containing all the zeros of a polynomial
- On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros
- On region containing all the zeros of a polynomial
- On the Location of Zeros of Polynomials
- On the Moduli of the Zeros of a Polynomial
- On the location of the zeros of a polynomial
Cited in
(3)
This page was built for publication: On comparison of annuli containing all the zeros of a polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034286)