Safe convergence of simultaneous methods for polynomial zeros
From MaRDI portal
Recommendations
Cited in
(19)- A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Chebyshev-like root-finding methods with accelerated convergence
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- On the new fourth-order methods for the simultaneous approximation of polynomial zeros
- General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
- An efficient higher order family of root finders
- Improved algorithms for computing determinants and resultants
- scientific article; zbMATH DE number 1512150 (Why is no real title available?)
- Point estimation of simultaneous methods for solving polynomial equations: A survey
- A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
- Point estimation of a family of simultaneous zero-finding methods
- scientific article; zbMATH DE number 1868929 (Why is no real title available?)
- On the convergence of Wang-Zheng's method
- A general semilocal convergence theorem for simultaneous methods for polynomial zeros and its applications to Ehrlich's and Dochev-Byrnev's methods
- On a cubically convergent derivative-free root finding method
- Point estimation of root finding methods
- On a modification of the Ehrlich–Aberth method for simultaneous approximation of polynomial zeros
- On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros
This page was built for publication: Safe convergence of simultaneous methods for polynomial zeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1264390)