2013
DOI: 10.1016/j.joems.2013.03.011
|View full text |Cite
|
Sign up to set email alerts
|

On a numerical technique for finding multiple zeros and its dynamic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
40
0
1

Year Published

2015
2015
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 51 publications
(45 citation statements)
references
References 20 publications
0
40
0
1
Order By: Relevance
“…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%
See 1 more Smart Citation
“…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%
“…In the last few decades, many researchers have worked to develop iterative methods for finding multiple roots with greater efficiency and higher order of convergence. Among them, Li et al [3] in 2009, Sharma and Sharma [4] and Li et al [5] in 2010, Zhou et al [6] in 2011, Sharifi et al [7] in 2012, Soleymani et al [8], Soleymani and Babajee [9], Liu and Zhou [10] and Zhou et al [11] in 2013, Thukral [12] in 2014, Behl et al [13] and Hueso et al [14] in 2015, and Behl et al [15] in 2016 presented optimal fourth-order methods for multiple zeros. Additionally, Li et al [5] (among other optimal methods) and Neta [16] presented non-optimal fourth-order iterative methods.…”
Section: Introductionmentioning
confidence: 99%
“…Since the Julia sets (chaotic sets) occur as one of the crucial component in these investigations, their various characterizations and identification of their intrinsic properties are primarily developed in these studies. This work has also applications in a number of diverse science and engineering areas wherein simulations of objects of fractal nature are needed [9,10,15,17,19,20,22,23]. Let C andĈ denote the complex plane and the extended complex plane respectively.…”
Section: Introductionmentioning
confidence: 99%