Three-point iterative algorithm in the absence of the derivative for solving nonlinear equations and their basins of attraction
Abstract In this paper, we suggested and analyzed a new higher-order iterative algorithm for solving nonlinear equation $$g(x)=0$$ g ( x ) = 0 , $$g:{\mathbb {R}}\longrightarrow {\mathbb {R}}$$ g : R ⟶ R , which is free from derivative by using the approximate version of the first derivative, and we...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
SpringerOpen
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/b3b3fb50989542d7b3cec1cb66686715 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract In this paper, we suggested and analyzed a new higher-order iterative algorithm for solving nonlinear equation $$g(x)=0$$ g ( x ) = 0 , $$g:{\mathbb {R}}\longrightarrow {\mathbb {R}}$$ g : R ⟶ R , which is free from derivative by using the approximate version of the first derivative, and we studied the basins of attraction for the proposed iterative algorithm to find complex roots of complex functions $$g:{\mathbb {C}}\longrightarrow {\mathbb {C}}$$ g : C ⟶ C . To show the effectiveness of the proposed algorithm for the real and the complex domains, the numerical results for the considered examples are given and graphically clarified. The basins of attraction of the existing methods and our algorithm are offered and compared to clarify their performance. The proposed algorithm satisfied the condition such that $$|x_{m}-\alpha |<1.0 \times 10^{-15}$$ | x m - α | < 1.0 × 10 - 15 , as well as the maximum number of iterations is less than or equal to 3, so the proposed algorithm can be applied to efficiently solve numerous type non-linear equations. |
|---|