2019
DOI: 10.3390/math7111076
|View full text |Cite
|
Sign up to set email alerts
|

A New Optimal Family of Schröder’s Method for Multiple Zeros

Abstract: Here, we suggest a high-order optimal variant/modification of Schröder’s method for obtaining the multiple zeros of nonlinear uni-variate functions. Based on quadratically convergent Schröder’s method, we derive the new family of fourth -order multi-point methods having optimal convergence order. Additionally, we discuss the theoretical convergence order and the properties of the new scheme. The main finding of the present work is that one can develop several new and some classical existing methods by adjustin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 18 publications
(28 reference statements)
0
4
0
Order By: Relevance
“…These can first overcome the onepoint algorithms' low efficiency index, and can also minimize the number of iterations and improve the order of convergence with multiple steps, which also lessens the computational burden in numerical work. Many researchers [20][21][22][23][24][25][26][27][28] have developed higher-order iterative techniques using the first-order derivative to locate the multiple roots of a nonlinear problem. One function and two derivative evaluations are needed per iteration for the optimal fourth-order methods established in the literature [20,21,[23][24][25]27,28].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…These can first overcome the onepoint algorithms' low efficiency index, and can also minimize the number of iterations and improve the order of convergence with multiple steps, which also lessens the computational burden in numerical work. Many researchers [20][21][22][23][24][25][26][27][28] have developed higher-order iterative techniques using the first-order derivative to locate the multiple roots of a nonlinear problem. One function and two derivative evaluations are needed per iteration for the optimal fourth-order methods established in the literature [20,21,[23][24][25]27,28].…”
Section: Introductionmentioning
confidence: 99%
“…Many researchers [20][21][22][23][24][25][26][27][28] have developed higher-order iterative techniques using the first-order derivative to locate the multiple roots of a nonlinear problem. One function and two derivative evaluations are needed per iteration for the optimal fourth-order methods established in the literature [20,21,[23][24][25]27,28]. Li et al have introduced six new fourth-order methods in [22].…”
Section: Introductionmentioning
confidence: 99%
“…Jaiswal [21] claimed to be the first to propose an optimal eighth-order method for multiple roots of unknown multiplicity. Many researchers have modified the Newton method using Schröder's approach [10] to develop new optimal methods for finding multiple roots [11][12][13][14]22,23]. However, there have been much less work done on developing methods using Traub's conceptual approach [16].…”
Section: Introductionmentioning
confidence: 99%
“…For this scheme, the multiplicity of the root is not required in advance, but it involves the first-order and second-order derivative of a function at each step. Many more researchers [13][14][15][16][17][18][19][20][21][22] developed the higher order iterative schemes involving the first-order derivative to find the multiple roots of a scalar equation. The evaluation of derivatives at each step is time consuming and sometimes a difficult job for any complex problem.…”
Section: Introductionmentioning
confidence: 99%