Mostrar el registro sencillo del ítem
dc.contributor.author | Cordero Barbero, Alicia | es_ES |
dc.contributor.author | Villalba, Eva G. | es_ES |
dc.contributor.author | Torregrosa Sánchez, Juan Ramón | es_ES |
dc.contributor.author | Triguero-Navarro, Paula | es_ES |
dc.date.accessioned | 2024-05-31T18:17:05Z | |
dc.date.available | 2024-05-31T18:17:05Z | |
dc.date.issued | 2023-06 | es_ES |
dc.identifier.issn | 0723-0869 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/204608 | |
dc.description.abstract | [EN] In this paper, we construct a derivative-free multi-step iterative scheme based on Steffensen's method. To avoid excessively increasing the number of functional evaluations and, at the same time, to increase the order of convergence, we freeze the divided differences used from the second step and use a weight function on already evaluated operators. Therefore, we define a family of multi-step methods with convergence order 2m, where m is the number of steps, free of derivatives, with several parameters and with dynamic behaviour, in some cases, similar to Steffensen's method. In addition, we study how to increase the convergence order of the defined family by introducing memory in two different ways: using the usual divided differences and the Kurchatov divided differences. We perform some numerical experiments to see the behaviour of the proposed family and suggest different weight functions to visualize with dynamical planes in some cases the dynamical behaviour. | es_ES |
dc.description.sponsorship | This research was partially supported by Universitat Politècnica de València Contrato Predoctoral, Spain PAID-01-20-17 (UPV) . | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier GmbH | es_ES |
dc.relation.ispartof | Expositiones Mathematicae | es_ES |
dc.rights | Reconocimiento (by) | es_ES |
dc.subject | Iterative methods | es_ES |
dc.subject | Nonlinear systems | es_ES |
dc.subject | Memory schemes | es_ES |
dc.subject | Basin of attraction | es_ES |
dc.subject | Dynamical plane | es_ES |
dc.subject.classification | MATEMATICA APLICADA | es_ES |
dc.title | Introducing memory to a family of multi-step multidimensional iterative methods with weight function | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.exmath.2023.04.004 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/UPV-VIN//PAID-01-20-17//Procesos iterativos multidimensionales de altas prestaciones para resolver ecuaciones vectoriales y matriciales no lineales/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Escuela Técnica Superior de Ingenieros de Telecomunicación - Escola Tècnica Superior d'Enginyers de Telecomunicació | es_ES |
dc.description.bibliographicCitation | Cordero Barbero, A.; Villalba, EG.; Torregrosa Sánchez, JR.; Triguero-Navarro, P. (2023). Introducing memory to a family of multi-step multidimensional iterative methods with weight function. Expositiones Mathematicae. 41(2):398-417. https://doi.org/10.1016/j.exmath.2023.04.004 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.exmath.2023.04.004 | es_ES |
dc.description.upvformatpinicio | 398 | es_ES |
dc.description.upvformatpfin | 417 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 41 | es_ES |
dc.description.issue | 2 | es_ES |
dc.relation.pasarela | S\492219 | es_ES |
dc.contributor.funder | UNIVERSIDAD POLITECNICA DE VALENCIA | es_ES |