scientific article; zbMATH DE number 3872574
From MaRDI portal
Publication:3339182
Recommendations
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- The simultaneous approximation of polynomial roots
- Ein numerisches Verfahren zur simultanen Ermittlung aller Nullstellen eines Polynoms. (A numerical method for the simultaneous computation of all zeros of a polynomial)
- Some generalizations of the Chebyshev method for simultaneous determination of all roots of polynomial equations
- scientific article; zbMATH DE number 4209461
Cited in
(13)- On a family of iterative methods for simultaneous extraction of all roots of algebraic polynomial
- Solving triangular algebraic systems by means of simultaneous iterations
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
- An iteration method of finding the roots of algebraic equation without repeated root
- On the local convergence of Ehrlich method for numerical computation of polynomial zeros
- scientific article; zbMATH DE number 4209461 (Why is no real title available?)
- A Globally Convergent Method for Simultaneously Finding Polynomial Roots
- scientific article; zbMATH DE number 3909639 (Why is no real title available?)
- scientific article; zbMATH DE number 4005461 (Why is no real title available?)
- scientific article; zbMATH DE number 57425 (Why is no real title available?)
- scientific article; zbMATH DE number 1557813 (Why is no real title available?)
- An efficient algorithm for computing the roots of general quadratic, cubic and quartic equations
- Ein numerisches Verfahren zur simultanen Ermittlung aller Nullstellen eines Polynoms. (A numerical method for the simultaneous computation of all zeros of a polynomial)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3339182)