论文信息 - Slope Methods of Higher Order for the Inclusion of Complex Roots of Polynomials

Slope Methods of Higher Order for the Inclusion of Complex Roots of Polynomials

We consider iterative methods for the inclusion of a simple complex root of a polynomial based on a slope in circular complex arithmetic. Combining the Newton method with the interval slope, two new algorithms of higher order in circular complex arithmetic are developed. The convergence analysis and numerical examples are included.

[1] Jon G. Rokne,et al. Computer Methods for the Range of Functions , 1984 .

[2] Ernst Schröder,et al. Ueber unendlich viele Algorithmen zur Auflösung der Gleichungen , 1870 .

[3] Miodrag S. Petković,et al. A computational test for the existence of polynomial zero , 1989 .

[4] Miodrag S. Petković,et al. A hybrid method for a polynomial complex zero , 1991 .

[5] Eldon Hansen. Computing Zeros of Functions Using Generalized Interval Arithmetic , 1994 .

[6] Eldon Hansen,et al. Global optimization using interval analysis , 1992, Pure and applied mathematics.

[7] Lubomir V. Kolev. Use of Interval Slopes for the Irrational Part of Factorable Functions , 1997, Reliab. Comput..

[8] A. Neumaier. Interval methods for systems of equations , 1990 .

[9] A. Neumaier,et al. Interval Slopes for Rational Functions and Associated Centered Forms , 1985 .

[10] J. Traub. Iterative Methods for the Solution of Equations , 1982 .

[11] Henry C. Thacher,et al. Applied and Computational Complex Analysis. , 1988 .

[12] Carsten Carstensen,et al. Some improved inclusion methods for polynomial roots with Weierstrass' corrections , 1993 .