2008
DOI: 10.1016/j.camwa.2007.09.001
|View full text |Cite
|
Sign up to set email alerts
|

High-order nonlinear solver for multiple roots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
89
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 85 publications
(89 citation statements)
references
References 9 publications
0
89
0
Order By: Relevance
“…[17,[6][7][8]10,11,13,14,21,24,25,27]. Some of these methods are considered optimal in the sense of Kung and Traub [9], i.e.…”
Section: Introductionmentioning
confidence: 99%
“…[17,[6][7][8]10,11,13,14,21,24,25,27]. Some of these methods are considered optimal in the sense of Kung and Traub [9], i.e.…”
Section: Introductionmentioning
confidence: 99%
“…It is known that numerical scheme (1.1) is a second-order one-point optimal [23] method on the basis of Kung-Traub's conjecture [23] that any multipoint method [35] without memory can reach its convergence order of at most 2 r−1 for r functional evaluations. We can find other higher-order multiple-zero finders in a number of literatures [16][17][18]21,24,25,31,32,40,45] .…”
Section: Introductionmentioning
confidence: 99%
“…a method of order 1.5 [5], a method of order 2 [6], third order methods [7][8][9][10][11][12][13][14][15][16][17], and [18]. The fourth order methods [19][20][21][22][23] and [24]. Some of these methods are considered optimal in the sense of Kung and Traub [25], i.e.…”
Section: Introductionmentioning
confidence: 99%