A family of simultaneous zero-finding methods
The authors propose a generally original iterative method to simultaneously calculate all zeros of a polynomial. The method improves on previously known methods accelerating the order of convergence from three to four. It contains, as particular cases, a number of other methods. Numerical examples, run in quadruple precision, illustrate the feasability of the method proposed.
scientific article; zbMATH DE number 1192639