Improving the order of convergence of iteration functions

Journal of Computational and Applied Mathematics

Volumn 98, Issue 2, 1998, Pages 311-315

  Osada, Naoki ^a  

^a TOKYO WOMAN'S CHRISTIAN UNIVERSITY   (Japan)

Author keywords

Acceleration of convergence; Iteration functions; Multiple roots; Order of convergence; Root finding methods; Single equations

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS;

ITERATION FUNCTIONS; MULTIPLE ROOTS; ROOT-FINDING METHODS; SINGLE EQUATIONS;

FUNCTIONS;

EID: 0032183498     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(98)00131-9     Document Type: Article

References (8)

1. M.R. Farmer, G. Loizou, An algorithm for the total, or partial, factorization of a polynomial, Math. Proc. Camb. Phil. Soc. 82 (1977) 427-437.
2. E. Hansen, M. Patrick, A family of root finding methods, Numer. Math. 27 (1977) 257-269.
3. B. Jovanović, A Method for obtaining iterative formulas of higher order, Mat. Vesnik. 9 (24) 365-369.
4. N. Osada, An optimal multiple root-finding method of order three, J. Comput. Appl. Math. 51 (1994) 131-133.
5. A.M. Ostrowski, Solution of Equations in Banach Spaces, Academic Press, New York, 1973.
6. M.S. Petković, S. Tričković, On zero-finding methods of the fourth order, J. Comput. Appl. Math. 64 (1995) 291-294.
7. E. Schröder, Über unendlich viele Algorithmen zur Auflösung der Gleichungen, Math. Ann. 2 (1870) 317-365.
8. J.F. Traub, Iterative Methods for the Solution of Equations, 2nd ed., Chelsea, New York, 1982.