A high-order iterative formula for simultaneous determination of zeros of a polynomial (Q1184136): Difference between revisions

The authors introduce two algorithms (simultaneous formulae by the Padé approximation and a hybrid method, respectively) to determine all zeros of a polynomial with complex coefficients, and present three examples with three tables of the numerical results. By the end the authors give explicit formulae of the algorithms for the methods of \textit{M. R. Farmer} and \textit{G. Loizou} [BIT, Nordisk Tidskr. Inform.-behandl. 15, 250-258 (1975; Zbl 0311.65036)] and of \textit{X. Wang} and \textit{S. Zheng} [J. Comput. Math. 2, 70-76 (1984; Zbl 0541.65028)] in the case of order \(m=2\).