A general three-step class of optimal iterations for nonlinear equations (Q410403)
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: A general three-step class of optimal iterations for nonlinear equations |
scientific article; zbMATH DE number 6021098
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general three-step class of optimal iterations for nonlinear equations |
scientific article; zbMATH DE number 6021098 |
Statements
A general three-step class of optimal iterations for nonlinear equations (English)
0 references
3 April 2012
0 references
Summary: Many of the engineering problems are reduced to solve a nonlinear equation numerically, and as a result, an especial attention to suggest efficient and accurate root solvers is given in literature. Inspired and motivated by the research going on in this area, this paper establishes an efficient general class of root solvers, where per computing step, three evaluations of the function and one evaluation of the first-order derivative are used to achieve the optimal order of convergence eight. The without-memory methods from the developed class possess the optimal efficiency index 1.682. In order to show the applicability and validity of the class, some numerical examples are discussed.
0 references
0 references
0 references
0.94064283
0 references
0.9355706
0 references
0.93191576
0 references
0 references