Derivative-free optimal multiple-root finding family of iterative methods
Computational and Applied Mathematics · 2026-08 · 45 (7)
DOI: 10.1007/s40314-026-03702-8 ↗Kurz gefasst
Fachartikel in der Zeitschrift Computational and Applied Mathematics, online erschienen am 13.03.2026. Verfasst von Julissa H. Jerezano und 2 weiteren Autor:innen. Die Arbeit nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universitat Politècnica de València.
Abstract (Originalsprache)
A new family of iterative methods for finding multiple roots of nonlinear problems is proposed. The family is derivative-free and optimal in the sense of Kung–Traub’s conjecture. The two-step family includes a weight function. The stability analysis uses two different weight functions: a polynomial and a rational function. Furthermore, a numerical benchmark is carried out on these two weight functions, showing the competitiveness concerning similar methods in the literature.
Förderung
- Universitat Politècnica de València
Zitieren
APA
Jerezano, J. H., Chicharro, F. I., & Garrido-Saez, N. (2026). Derivative-free optimal multiple-root finding family of iterative methods. Computational and Applied Mathematics, 45(7). https://doi.org/10.1007/s40314-026-03702-8
Vancouver
Jerezano JH, Chicharro FI, Garrido-Saez N. Derivative-free optimal multiple-root finding family of iterative methods. Computational and Applied Mathematics. 2026;45(7). doi:10.1007/s40314-026-03702-8
BibTeX
@article{Jerezano2026,
author = {Jerezano, Julissa H. and Chicharro, Francisco I. and Garrido-Saez, Neus},
title = {Derivative-free optimal multiple-root finding family of iterative methods},
journal = {Computational and Applied Mathematics},
year = {2026},
volume = {45},
number = {7},
doi = {10.1007/s40314-026-03702-8}
}
EUVIMED