New Highly Efficient Families of Higher-Order Methods for Simple Roots, Permitting f′(xn)=0
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 Ostro...
Saved in:
Main Authors: | Ramandeep Behl, V. Kanwar |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2014-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/2014/264529 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Difference Equation xn+1=∑j=0kajfj(xn−j)
by: Stevo Stevic
Published: (2007-01-01) -
On the global behavior of the nonlinear difference equation xn+1=f(pn,xn−m,xn−t(k+1)+1)
by: Taixiang Sun, et al.
Published: (2006-01-01) -
On the recursive sequence xn+1=−1/xn+A/xn−1
by: Stevo Stević
Published: (2001-01-01) -
Global Behavior of the Difference Equation xn+1=xn-1g(xn)
by: Hongjian Xi, et al.
Published: (2014-01-01) -
On the Solutions of the System of Difference Equations xn+1=max{A/xn,yn/xn}, yn+1=max{A/yn,xn/yn}
by: Dağistan Simsek, et al.
Published: (2009-01-01)