| dc.creator | Torkashvand, Vali | |
| dc.creator | Momenzadeh, Mohammad | |
| dc.creator | Lotf, Taher | |
| dc.date | 2020-10-01 | |
| dc.date.accessioned | 2020-10-16T12:44:58Z | |
| dc.date.available | 2020-10-16T12:44:58Z | |
| dc.identifier | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3592 | |
| dc.identifier | 10.22199/issn.0717-6279-2020-05-0072 | |
| dc.identifier.uri | https://revistaschilenas.uchile.cl/handle/2250/155190 | |
| dc.description | 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. | en-US |
| dc.format | application/pdf | |
| dc.format | application/pdf | |
| dc.language | eng | |
| dc.publisher | Universidad Católica del Norte. | en-US |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3592/3553 | |
| dc.relation | https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/3592/3554 | |
| dc.rights | Copyright (c) 2020 Vali Torkashvand, Mohammad Momenzadeh, Taher Lotf | en-US |
| dc.rights | http://creativecommons.org/licenses/by/4.0 | en-US |
| dc.source | Proyecciones (Antofagasta, On line); Vol. 39 No. 5 (2020); 1167-1189 | en-US |
| dc.source | Proyecciones. Revista de Matemática; Vol. 39 Núm. 5 (2020); 1167-1189 | es-ES |
| dc.source | 0717-6279 | |
| dc.source | 10.22199/issn.0717-6279-2020-05 | |
| dc.subject | Nonlinear equations | en-US |
| dc.subject | Simple roots | en-US |
| dc.subject | Computational order of convergence | en-US |
| dc.subject | Weight function | en-US |
| dc.subject | Recursive method with memory | en-US |
| dc.subject | 65G99 | en-US |
| dc.subject | None of the above, but in this section | en-US |
| dc.subject | 49M15 | en-US |
| dc.subject | Newton-type methods | en-US |
| dc.subject | 65H05 | en-US |
| dc.subject | Numerical computation of solutions to single equations | en-US |
| dc.title | Creating a new two-step recursive memory method with eight-order based on Kung and Traub's method. | en-US |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
| dc.type | Peer-reviewed Article | en-US |
| dc.type | text | en-US |
