Skip to main content

SISTEMAS DINAMICOS CONTINUOS Y DISCRETOS: BIFURCACIONES, ORBITAS PERIODICAS, INTEGRABILIDAD Y APLICACIONES

PID2022-136613NB-I00

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2022
State Plan 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 1
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publication Capítulo o parte de un libro (BookPart)

On two families of iterative methods without memory

  • Cima, Anna
  • Gasull Embid, Armengol
  • Mañosa Fernández, Víctor|||0000-0002-5082-3334
  • Mañosas, Francesc
This is an Accepted Manuscript version of the following work: Cima, A., Gasull, A., Mañosa, V., Mañosas, F. (2026). On Two Families of Iterative Methods Without Memory. In: Elaydi, S., Gardini, L., Lozi, R., Radi, D. (eds) Difference Equations and Discrete Dynamical Systems with Applications. ICDEA 2024. Springer Proceedings in Mathematics & Statistics, vol 556. Springer, Cham. This version of the manuscript has been accepted for publication, after final editorial and peer review (where applicable) is complete, but is not the version of record and does not reflect post-acceptance improvements (such as copyediting or typesetting), or any corrections. The final authenticated version is available online at: https://doi.org/10.1007/978-3-032-25494-8_8. Use of this Accepted Manuscript version is subject to the publisher’s Accepted Manuscript terms of use: https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms, We study two natural families of methods of order n>=2 that are useful for solving numerically one variable equations $f(x)=0.$ The first family consists on the methods that depend on x,f(x) and its successive derivatives up to f^(n-1)(x) and the second family comprises methods that depend on x,g(x) until g^{n}(x), where g^{m}(x) means the composition and g(x)=f(x)+x. The first family includes the well-known Newton, Chebyshev, and Halley methods, while the second one contains the Steffensen method. Although the results for the first type of methods are well known and classical, we provide new, simple, detailed, and self-contained proofs., This work is supported by Ministry of Science and Innovation–State Research Agency of the Spanish Government through grants PID2022-136613NB-I00 and PID2023-146424NB-I00. It is also supported by the grants 2021-SGR-00113 and 2021-SGR-01039 from AGAUR of Generalitat de Catalunya., Peer Reviewed