On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
From MaRDI portal
Recommendations
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
- The guaranteed convergence of Laguerre-like method
- On the guaranteed convergence of the square-root iteration method
- The convergence of a family of parallel zero-finding methods
Cited in
(12)- An optimized iterative method for numerical solution of large systems of equations based on the extremal property of zeroes of Chebyshev polynomials
- The convergence of a family of parallel zero-finding methods
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
- On the convergence of Chebyshev's method for multiple polynomial zeros
- Semilocal convergence of Chebyshev-like root-finding method for simultaneous approximation of polynomial zeros
- On the Newton-like method for the inclusion of a polynomial zero
- scientific article; zbMATH DE number 1868929 (Why is no real title available?)
- On the guaranteed convergence of the Japanese zero-finding method
- On the guaranteed convergence of a cubically convergent Weierstrass-like root-finding method
- scientific article; zbMATH DE number 6395662 (Why is no real title available?)
- The guaranteed convergence of Laguerre-like method
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros
This page was built for publication: On the guaranteed convergence of Chebishev-like method for computing polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5299433)