New families of third-order iterative methods for finding multiple roots

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Two families of third-order iterative methods for finding multiple roots of nonlinear equations are developed in this paper. Mild conditions are given to assure the cubic convergence of two iteration schemes (I) and (II). The presented families include many third-order methods for finding multiple roots, such as the known Dong's methods and Neta's method. Some new concrete iterative methods are provided. Each member of the two families requires two evaluations of the function and one of its first derivative per iteration. All these methods require the knowledge of the multiplicity. The obtained methods are also compared in their performance with various other iteration methods via numerical examples, and it is observed that these have better performance than the modified Newton method, and demonstrate at least equal performance to iterative methods of the same order. © 2014 R. F. Lin et al.

Cite

CITATION STYLE

APA

Lin, R. F., Ren, H. M., Šmarda, Z., Wu, Q. B., Khan, Y., & Hu, J. L. (2014). New families of third-order iterative methods for finding multiple roots. Journal of Applied Mathematics, 2014. https://doi.org/10.1155/2014/812072

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free