1969
DOI: 10.1007/bf01933248
|View full text |Cite
|
Sign up to set email alerts
|

Some efficient fourth order multipoint methods for solving equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
67
0
1

Year Published

1971
1971
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 110 publications
(71 citation statements)
references
References 1 publication
0
67
0
1
Order By: Relevance
“…In general, multipoint iterative methods [22,23] finding a zero α of a nonlinear equation f (x) = 0 can be written as Investigation of such dynamics clearly motivates our current analysis, which enables us to write the proposed method (2.1) in the following form:…”
Section: Extraneous Fixed Pointsmentioning
confidence: 86%
“…In general, multipoint iterative methods [22,23] finding a zero α of a nonlinear equation f (x) = 0 can be written as Investigation of such dynamics clearly motivates our current analysis, which enables us to write the proposed method (2.1) in the following form:…”
Section: Extraneous Fixed Pointsmentioning
confidence: 86%
“…From equations (2.4) and (2.5), we get 6) and in combination with Taylor series expansion of f x n − f (xn)…”
Section: Development Of Our Optimal Schemementioning
confidence: 99%
“…As fixed points satisfy O p (z, c) = z, it can be checked that z = 0 and z = ∞, associated to the roots of p(z), are fixed points and also the strange fixed points z = 1 and the roots of polynomial 6+(42+18α)z + (126 + 90α + 18α 2 )z 2 + (180 + 156α + 48α 2 + 6α 3 − α 3 β)z 3 + (126 + 90α + 18α 2 )z 4 + (42 + 18α)z 5 + 6z 6 , that will be called s i (α, β), i = 1, 2, . .…”
Section: Dynamical Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…In [9] Kung and Traub conjectured that the iterative method which requires n + 1 function evaluations per iteration can reach at most 2 n convergence order in general. The methods that satisfy KungTraub conjecture are known as optimal methods (see [10], [11], [12], [13], [14], [15], [16], [14], [18], [19]). This research presents a new family of such optimal eighth order methods.…”
Section: Introductionmentioning
confidence: 99%