On computational efficiency of the iterative methods for the simultaneous approximation of polynomial zeros. (English) Zbl 0623.65055
The authors suggest a measure for the computational efficiency of iterative methods for the simultaneous determination of polynomial zeros which takes into account the R-order of convergence and the number of arithmetic operations per iteration step.
Reviewer: G.Merz
MSC:
| 65H05 | Numerical computation of solutions to single equations |
| 26C10 | Real polynomials: location of zeros |
| 30C15 | Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) |
| 68Q25 | Analysis of algorithms and problem complexity |
