Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alefeld, G.: Bounding the Slope of Polynomial Operators and Some Applications, Computing 26 (1981), pp. 227–237.
Carstensen, C. and Petković, M. S.: On Some Modifications of Gargantini's Simultaneous Inclusion Method for Polynomial Roots by Schroeder's Correction, Appl. Numer. Math. 25 (1993), pp. 59–67.
Hansen, E.: Global Optimization Using Interval Analysis, Marsel Dekker, New York, 1992.
Hansen, E.: Computing Zeros of Functions Using Generalized Interval Arithmetic, Interval Comput. 3 (1993), pp. 3–28.
Henrici, P.: Applied and Computational Complex Analysis, Vol. I, John Wiley and Sons, New York, 1974.
Herzberger, J. and Metzner, L.: On the Q-Order and R-Order of Convergence for Coupled Sequences Arising in Iterative Numerical Processes, in: Alefeld, G. and Herzberger, J. (eds), Numerical Methods and Error Bounds, Mathematical Research, Vol. 89, Akademie Verlag, Berlin, 1996, pp. 120–131.
Kolev, L. V.: Use of Interval Slopes for the Irrational Part of Factorable Functions, Reliable Computing 3(1) (1997), pp. 83–93.
Krawczyk, R.: Intervallsteigungen für rationale Fnktionen und zugeordnete zentrische Formen, Freiburger Intervall-Berichte 2 (1983), pp. 1–30.
Krawczyk, R. and Neumaier, A.: Interval Slopes for Rational Functions and Associated Centered Forms, SIAM J. Numer. Anal. 22 (1985), pp. 604–616.
Moore, R. E.: Interval Analysis, Prentice-Hall, Englewood Cliffs, New Jersey, 1966.
Neumaier, A.: Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
Petković, L. D., Tričković, S., and Živković, D.: Secant Slope Method for Inclusion of Complex Zeros of Polynomials, in: Alefeld, G. and Herzberger, J. (eds), Numerical Methods and Error Bounds, Mathematical Research, Vol. 89, Akademie Verlag, Berlin, 1996, pp. 172–177.
Petković, M. S. and Carstensen, C.: On Some Improved Inclusion Methods for Polynomial Roots with Weierstrass' Corrections, Comput. Math. Appls. 25 (1993), pp. 59–67.
Petković, M. S. and Cvetković, L.: A Hybrid Method for a Polynomial Complex Zero, Comput. Math. Appls. 21 (1991), pp. 181–186.
Petković, M. S. and Petković, L. D.: A Computational Test for the Existence of Polynomial Zero, Comput. Math. Appls. 17 (1989), pp. 1109–1114.
Ratschek, H. and Rokne, J.: Computer Methods for the Range of Functions, Ellis Horwood, Chichester, 1984.
Schmidt, J. W.: On the R-Order of Coupled Sequences, Computing 26 (1981), pp. 333–342.
Schröder, E.: Über unendlich viele Algorithmen zur Auflösung der Gleichungen, Math. Ann. 2 (1870), pp. 317–365.
Traub, J. F. Iterative Methods for the Solution of Equations, Prentice-Hall, Englewood Cliffs, New Jersey, 1964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Petković, L.D., Tričković, S. & Petković, M.S. Slope Methods of Higher Order for the Inclusion of Complex Roots of Polynomials. Reliable Computing 3, 349–362 (1997). https://doi.org/10.1023/A:1009903702722
Issue Date:
DOI: https://doi.org/10.1023/A:1009903702722