Higher-order simultaneous methods for the determination of polynomial multiple zeros
From MaRDI portal
Publication:4467338
Cites work
- A family of root finding methods
- A note on some improvements of the simultaneous methods for determination of polynomial zeros
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 1194122 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Iterative methods for simultaneous inclusion of polynomial zeros
- On some improvements of square root iteration for polynomial complex zeros
- On the convergence order of a modified method for simultaneous finding polynomial zeros
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Some modifications of Laguerre's method
Cited in
(5)- 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
- Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials
- On the construction of simultaneous methods for multiple zeros
- 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
- A high order iteration formula for the simultaneous inclusion of polynomial zeros
This page was built for publication: Higher-order simultaneous methods for the determination of polynomial multiple zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4467338)