An efficient class of Traub-Steffensen-type methods for computing multiple zeros (Q2306338): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3390/axioms8020065 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2944987332 / rank | |||
Normal rank |
Latest revision as of 20:21, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient class of Traub-Steffensen-type methods for computing multiple zeros |
scientific article |
Statements
An efficient class of Traub-Steffensen-type methods for computing multiple zeros (English)
0 references
23 March 2020
0 references
Summary: Numerous higher-order methods with derivative evaluations are accessible in the literature for computing multiple zeros. However, higher-order methods without derivatives are very rare for multiple zeros. Encouraged by this fact, we present a family of third-order derivative-free iterative methods for multiple zeros that require only evaluations of three functions per iteration. Convergence of the proposed class is demonstrated by means of using a graphical tool, namely basins of attraction. Applicability of the methods is demonstrated through numerical experimentation on different functions that illustrates the efficient behavior. Comparison of numerical results shows that the presented iterative methods are good competitors to the existing techniques.
0 references
nonlinear equations
0 references
multiple roots
0 references
derivative-free method
0 references
convergence
0 references