Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method
Abstract We are devoted to the study of an iterative recursive Traub-Steffensen like method for approximating the simple roots of a nonlinear equation. Using the recursive technique, the R-order of convergence is increased from 4 to 8 without any new function evaluations, which means 100% improvemen...
Guardado en:
| Autores principales: | , , |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad Católica del Norte, Departamento de Matemáticas
2020
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000501167 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract We are devoted to the study of an iterative recursive Traub-Steffensen like method for approximating the simple roots of a nonlinear equation. Using the recursive technique, the R-order of convergence is increased from 4 to 8 without any new function evaluations, which means 100% improvement of the order of the convergence. The theoretical study of the convergence rate is investigated and demonstrated. A few nonlinear problems are presented to justify the theoretical study. |
|---|