论文信息 - A high-order iterative formula for simultaneous determination of zeros of a polynomial

A high-order iterative formula for simultaneous determination of zeros of a polynomial

Abstract We propose a hybrid method to determine all the zeros of a polynomial simultaneously, by combining the single-root method and the simultaneous one. The present method has a high convergence order even for multiple roots by using the Pade approximation.

[1] A. W. Nourein,et al. An iteration formula for the simultaneous determination of the zeros of a polynomial , 1975 .

[2] George Loizou,et al. A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial , 1975 .

[3] J. Kuntzmann,et al. Solutions Numeriques des Equations Algebriques , 1963 .

[4] M. Marden. Geometry of Polynomials , 1970 .

[5] Tomaso Pomentale,et al. A class of iterative methods for holomorphic functions , 1971 .

[6] C. Brezinski. Padé-type approximation and general orthogonal polynomials , 1980 .

[7] Annie Cuyt,et al. Nonlinear Methods in Numerical Analysis , 1987 .

[8] Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros , 1982 .

[9] Oliver Aberth,et al. Iteration methods for finding all zeros of a polynomial simultaneously , 1973 .