论文信息 - On the Convergence Rate of Symmetric Single-Step Method ISS for Simultaneous Bounding Polynomial Zeros

On the Convergence Rate of Symmetric Single-Step Method ISS for Simultaneous Bounding Polynomial Zeros

A new modified method ISS for the simultaneous bounding all the zeros of a polynomial is formulated in this paper. The efficiency of this method is measured on the CPU times and the number of iterations after satisfying the convergence criteria where the results are obtained using five tested polynomials. The R-order of convergence of this method is at least 9.

Wah June Leong | Mansor Monsi | Malik Abu Hassan | N. R. Salim

[1] Jürgen Herzberger,et al. On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots , 1974 .

[2] James M. Ortega,et al. Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[3] G. Alefeld,et al. Introduction to Interval Computation , 1983 .

[4] A. W. Nourein. An improvement on Nourein's method for the simultaneous determination of the zeroes of a polynomial (An algorithm) , 1977 .

[5] Louis W. Ehrlich,et al. A modified Newton method for polynomials , 1967, CACM.

[6] Siegfried M. Rump,et al. INTLAB - INTerval LABoratory , 1998, SCAN.

[7] Oliver Aberth,et al. Iteration Methods for Finding all Zeros of , 1973 .

[8] W. Börsch-Supan. A posteriori error bounds for the zeros of polynomials , 1963 .

[9] Miodrag S. Petkovic,et al. On the convergence order of a modified method for simultaneous finding polynomial zeros , 2005, Computing.

[10] Miodrag S. Petković,et al. Iterative Methods for Simultaneous Inclusion of Polynomial Zeros , 1989 .

[11] Alan J. Laub,et al. On the Iterative Solution of a Class of Nonsymmetric Algebraic Riccati Equations , 2000, SIAM J. Matrix Anal. Appl..