Improving the order of convergence of iteration functions. (English) Zbl 0935.65052

Summary: Improving methods for the order of convergence of iteration functions are given. Using these methods new third- or fourth-order root-finding methods for a single equation with a multiple root are derived. Numerical examples are given.


65H05 Numerical computation of solutions to single equations
65E05 General theory of numerical methods in complex analysis (potential theory, etc.)
Full Text: DOI


[1] Farmer, M.R.; Loizou, G., An algorithm for the total, or partial, factorization of a polynomial, (), 427-437 · Zbl 0374.65019
[2] Hansen, E.; Patrick, M., A family of root finding methods, Numer. math., 27, 257-269, (1977) · Zbl 0361.65041
[3] B. Jovanović, A Method for obtaining iterative formulas of higher order, Mat. Vesnik. 9 (24) 365-369.
[4] Osada, N., An optimal multiple root-finding method of order three, J. comput. appl. math., 51, 131-133, (1994) · Zbl 0814.65045
[5] Ostrowski, A.M., Solution of equations in Banach spaces, (1973), Academic Press New York · Zbl 0304.65002
[6] Petković, M.S.; Tričković, S., On zero-finding methods of the fourth order, J. comput. appl. math., 64, 291-294, (1995) · Zbl 0857.65054
[7] Schröder, E., Über unendlich viele algorithmen zur auflösung der gleichungen, Math. ann., 2, 317-365, (1870)
[8] Traub, J.F., Iterative methods for the solution of equations, (1982), Chelsea New York · Zbl 0472.65040
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.