Pasar al contenido principal

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Computing parameter planes of iterative root-finding methods with several free critical points

  • Campos, Beatriz
  • Canela, Jordi
  • Rodríguez-Arenas, Alberto
  • Vindel, Pura
[EN] In this paper we present an algorithm to obtain the parameter planes of families of root-finding methods with several free critical points. The parameter planes show the joint behaviour of all critical points. This algorithm avoids the inconsistencies arising from the relationship between the different critical points as well as the indeterminacy caused by the square roots involved in their computation. We analyse the suitability of this algorithm by drawing the parameter planes of different Newton-like methods with two and three critical points. We also present some results of the expressions of the Newton-like operators and their derivatives in terms of palindromic polynomials, and we show how to obtain the expression of the critical points of a Newton-like method with real coefficients., The first, second, and fourth authors are supported the project UJI-B2022-46 funded by Universitat Jaume I, Spain. The first and second authors are also supported by the project CIGE/2023/102 funded by Generalitat Valenciana, Spain. The second author is also supported by PID2020-118281GB-C32 (MCIU/AEI/FEDER/UE) . The third author is supported by Accio 3.2 POSDOC/2020/14 of Universitat Jaume I, Spain and by Ayudas Margarita Salas 2021-2023 of Universitat Politecnica de Valencia funded by the Spanish Ministry of Universities (Plan de Recuperacion, Transformacion y Resiliencia) and European Union-Next generation EU (RD 289/2021 and UNI/551/2021) .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Dynamical and numerical analysis of classical multiple roots finding methods applied for different multiplicities

  • Campos, Beatriz
  • Garcia-Villalba, Eva
  • Vindel, Pura
[EN] The aim of this paper is the study of the robustness of classical methods defined for finding multiple roots with single multiplicity m when they are used for approximating different roots of a function having different multiplicities. To do so, we first study the dynamical behaviour of such methods when they are applied for approximating multiple roots with different multiplicities of a polynomial. Secondly, based on the obtained dynamical results, we analyse numerically their behaviour and convergence when we carry out the approximation in the case of functions that combine polynomial, exponential and logarithmic functions., The authors wish to thank reviewers for the careful reading and valuable comments which have improved the quality of this paper. The first and the third authors are supported by the project UJI-B2022-46.