Abstract
A family of three-step optimal eighth-order iterative algorithm is developed in this paper in order to find single roots of nonlinear equations using the weight function technique. The newly proposed iterative methods of eight order convergence need three function evaluations and one first derivative evaluation that satisfies the Kung–Traub optimality conjecture in terms of computational cost per iteration (i.e. (Formula presented.)). Furthermore, using the primary theorem that establishes the convergence order, the theoretical convergence properties of our schemes are thoroughly investigated. On several engineering applications, the performance and efficiency of our optimal iteration algorithms are examined to those of existing competitors. The new iterative schemes are more efficient than the existing methods in the literature, as illustrated by the basins of attraction, dynamical planes, efficiency, log of residual, and numerical test examples.
| Original language | English |
|---|---|
| Pages (from-to) | 708-735 |
| Number of pages | 28 |
| Journal | Applied Mathematics in Science and Engineering |
| Volume | 30 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2022 |
| Externally published | Yes |
Keywords
- 65-04
- 65H04
- 65H05
- 65H10
- 65H17
- Numerical technique
- computational efficiency
- computational time
- iterative methods
- optimal order
Fingerprint
Dive into the research topics of 'Efficient iterative scheme for solving non-linear equations with engineering applications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver