Some efficient seventh-order derivative-free families in root-finding (Q2842011)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some efficient seventh-order derivative-free families in root-finding |
scientific article; zbMATH DE number 6192866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some efficient seventh-order derivative-free families in root-finding |
scientific article; zbMATH DE number 6192866 |
Statements
Some efficient seventh-order derivative-free families in root-finding (English)
0 references
30 July 2013
0 references
nonlinear equation
0 references
derivative-free families
0 references
order
0 references
iterative methods
0 references
root-finding algorithm
0 references
simple roots
0 references
convergence
0 references
numerical examples
0 references
The author proposes some 7th-order root-finding algorithms for solving nonlinear equations with simple roots. Moreover, the algorithms require only a few function evaluations per iteration and hence they can be used to solve nonlinear equations without computing the derivatives. Detail derivations of the methods and rigorious convergence analysis are presented. The techniques used are based on some existing theories by \textit{H. T. Kung} and \textit{J. F. Traub} [J. Assoc. Comput. Mach. 21, 643--651 (1974; Zbl 0289.65023)]. Finally, some numerical examples are given to illustrate that the proposed methods are able to locate the simple roots.
0 references