2015
DOI: 10.1016/j.amc.2015.05.004
|View full text |Cite
|
Sign up to set email alerts
|

On developing fourth-order optimal families of methods for multiple roots and their dynamics

Abstract: Motsa, SS.; Torregrosa Sánchez, JR. (2015). On developing fourth-order optimal families of methods for multiple roots and their dynamics. Applied Mathematics and Computation. 265:520-532. doi:10.1016/j.amc.2015 AbstractThere are few optimal fourth-order methods for solving nonlinear equations when the multiplicity m of the required root is known in advance. Therefore, the first focus of this paper is on developing new fourth-order optimal families of iterative methods by a simple and elegant way. Computationa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
46
0
1

Year Published

2017
2017
2024
2024

Publication Types

Select...
8

Relationship

4
4

Authors

Journals

citations
Cited by 49 publications
(47 citation statements)
references
References 24 publications
0
46
0
1
Order By: Relevance
“…The result of Theorem 3 enables us to discover that = 0 (corresponding to fixed point of or root of ( ) = [( − )( − )] ) and = ∞ (corresponding to fixed point of or root of ( )) are clearly two of their fixed points of the conjugate map ( ; ), regardless of -values. Besides, by direct computation, we find that = 1 is a strange fixed point [13][14][15] of (that is not a root of ( ) = [( − )( − )] ) due to the fact that (1; ) = 1, regardless of -values.…”
Section: Conjugacy Maps and Dynamicsmentioning
confidence: 90%
“…The result of Theorem 3 enables us to discover that = 0 (corresponding to fixed point of or root of ( ) = [( − )( − )] ) and = ∞ (corresponding to fixed point of or root of ( )) are clearly two of their fixed points of the conjugate map ( ; ), regardless of -values. Besides, by direct computation, we find that = 1 is a strange fixed point [13][14][15] of (that is not a root of ( ) = [( − )( − )] ) due to the fact that (1; ) = 1, regardless of -values.…”
Section: Conjugacy Maps and Dynamicsmentioning
confidence: 90%
“…Construction of higher‐order iterative methods for multiple roots having prior knowledge of multiplicity ( m >1) is one of the most important and challenging task in computational mathematics. No doubts, we have a small number of fourth‐order iterative methods for multiple roots, which were proposed by Neta and Johnson in (2008), Li et al in (2009), Neta, Sharma and Sharma, and Li et al in (2010), Zhou et al in (2011), Sharifi et al in (2012), Soleymani et al, Soleymani and Babajee, Liu and Zhou, and Zhou et al in (2013), Thukral in (2014), Behl et al and Hueso et al in (2015), Behl et al in (2016), and Zafar et al in (2018).…”
Section: Introductionmentioning
confidence: 99%
“…Construction of higher-order iterative methods for multiple roots having prior knowledge of multiplicity (m > 1) is one of the most important and challenging task in computational mathematics. No doubts, we have a small number of fourth-order iterative methods for multiple roots, which were proposed by Neta 8 Soleymani and Babajee, 9 Liu and Zhou, 10 and Zhou et al 11 in (2013), Thukral 12 in (2014), Behl et al 13 Out of them, iterative functions proposed by Li et al 5 (expect two of them are optimal), Neta and Johnson, 1 and Neta 3 are nonoptimal schemes of fourth order. On the other hand, rest of them are optimal according to classical Kung-Traub conjecture.…”
Section: Introductionmentioning
confidence: 99%
“…Newton's method has been widely accepted in view of its simplicity and quadratic convergence. Development of higher-order iterative root-finding schemes [1][2][3][4][5][6][7][8] has been a primary topic among the scholars and researchers working in this area.…”
Section: Introductionmentioning
confidence: 99%