2019
DOI: 10.3846/mma.2019.026
|View full text |Cite
|
Sign up to set email alerts
|

Higher-Order Families of Multiple Root Finding Methods Suitable for Non-Convergent Cases and Their Dynamics

Abstract: In this paper, we present many new one-parameter families of classical Rall's method (modified Newton's method), Schröder's method, Halley's method and super-Halley method for the first time which will converge even though the guess is far away from the desired root or the derivative is small in the vicinity of the root and have the same error equations as those of their original methods respectively, for multiple roots. Further, we also propose an optimal family of iterative methods of fourth-order convergenc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
(38 reference statements)
0
2
0
Order By: Relevance
“…Nowadays, there are a plethora of convergence results about the iterative methods of the type (1) but the proofs are often based on Taylor's expansions or other methods that require the existence of higher-order derivatives of f and ensure only asymptotic error constants where available. Moreover, the most of the existing convergence theorems do not provide exact information about the sets of initial approximations that guarantee the convergence of the iteration (1) (see e.g., [5][6][7] and the references therein).…”
Section: Introductionmentioning
confidence: 99%
“…Nowadays, there are a plethora of convergence results about the iterative methods of the type (1) but the proofs are often based on Taylor's expansions or other methods that require the existence of higher-order derivatives of f and ensure only asymptotic error constants where available. Moreover, the most of the existing convergence theorems do not provide exact information about the sets of initial approximations that guarantee the convergence of the iteration (1) (see e.g., [5][6][7] and the references therein).…”
Section: Introductionmentioning
confidence: 99%
“…Our technique can also be used to extend the applicability of other methods defined in [1][2][3]. The novelty of our work, compared to other such as [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18], is that we give weaker conditions, only in the first derivative, to guarantee the convergence of the described method.…”
Section: Introductionmentioning
confidence: 99%