Widening basins of attraction of optimal iterative methods
[EN] In this work, we analyze the dynamical behavior on quadratic polynomials of a class of derivative-free optimal parametric iterative methods, designed by Khattri and Steihaug. By using their parameter as an accelerator, we develop different methods with memory of orders three, six and twelve, wi...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/102246 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/102246 |
| Access Level: | acceso abierto |
| Palabra clave: | Multi-point iterative methods Dynamical plane Basin of attraction With and without memory methods Kung and Traub&apos s conjecture Efficiency index MATEMATICA APLICADA |
| Sumario: | [EN] In this work, we analyze the dynamical behavior on quadratic polynomials of a class of derivative-free optimal parametric iterative methods, designed by Khattri and Steihaug. By using their parameter as an accelerator, we develop different methods with memory of orders three, six and twelve, without adding new functional evaluations. Then a dynamical approach is made, comparing each of the proposed methods with the original ones without memory, with the following empiric conclusion: Basins of attraction of iterative schemes with memory are wider and the behavior is more stable. This has been numerically checked by estimating the solution of a practical problem, as the friction factor of a pipe and also of other nonlinear academic problems. |
|---|