New highly efficient families of higher-order methods for simple roots, permitting f′(xn)=0

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Construction of higher-order optimal and globally convergent methods for computing simple roots of nonlinear equations is an earliest and challenging problem in numerical analysis. Therefore, the aim of this paper is to present optimal and globally convergent families of King's method and Ostrowski's method having biquadratic and eight-order convergence, respectively, permitting f′(x)=0 in the vicinity of the required root. Fourth-order King's family and Ostrowski's method can be seen as special cases of our proposed scheme. All the methods considered here are found to be more effective to the similar robust methods available in the literature. In their dynamical study, it has been observed that the proposed methods have equal or better stability and robustness as compared to the other methods. © 2014 Ramandeep Behl and V. Kanwar.

Cite

CITATION STYLE

APA

Behl, R., & Kanwar, V. (2014). New highly efficient families of higher-order methods for simple roots, permitting f′(xn)=0. International Journal of Mathematics and Mathematical Sciences, 2014. https://doi.org/10.1155/2014/264529

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