Skip to main content

ESTABILIDAD Y CAOS EN ITERACION HOLOMORFA

PID2020-118281GB-C32

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Call Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Call year 2020
State Plan 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSIDAD DE BARCELONA

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

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

  • Campos, Beatriz|||0000-0001-9205-0256
  • Canela Sánchez, Jordi|||0000-0001-7879-5438
  • Rodríguez-Arenas, Alberto|||0000-0002-4571-2031
  • Vindel, Pura|||0000-0001-8422-4738
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.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Connected McMullen-Like Julia Sets in a Chebyshev-Halley Family

  • Canela Sánchez, Jordi|||0000-0001-7879-5438
  • Garijo, Antoni|||0000-0002-1503-7514
  • Roesch, Pascale
In this paper we study a one parameter family of rational maps obtained by applying the Chebyshev-Halley root-finding algorithms. We show that the dynamics near parameters where the family presents some degeneracy might be understood from the point of view of singular perturbations. More precisely, we relate the dynamics of those maps with the one of the McMullen family Mλ(z) = z4 + λ/z2, using quasiconformal surgery.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication 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) .
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Dynamical mechanism behind ghosts unveiled in a map complexification

  • Canela Sánchez, Jordi|||0000-0001-7879-5438
  • Alsedà, Lluís|||0000-0001-9908-1063
  • Fagella, Núria|||0000-0002-5466-0579
  • Sardanyés, Josep|||0000-0001-7225-5158
Complex systems such as ecosystems, electronic circuits, lasers, or chemical reactions can be modelled by dynamical systems which typically experience bifurcations. It is known that transients become extremely long close to bifurcations, also following well-defined scaling laws as the bifurcation parameter gets closer the bifurcation value. For saddle-node bifurcations, the dynamical mechanism responsible for these delays, tangible at the real numbers phase space (so-called ghosts), occurs at the complex phase space. To study this phenomenon we have complexified an ecological map with a saddle-node bifurcation. We have investigated the complex (as opposed to real) dynamics after this bifurcation, identifying the fundamental mechanism causing such long delays, given by the presence of two repellers in the complex space. Such repellers appear to be extremely close to the real line, thus forming a narrow channel close to the two new fixed points and responsible for the slow passage of the orbits. We analytically provide the relation between the well-known inverse square-root scaling law of transient times and the multipliers of these repellers. We finally prove that the same phenomenon occurs for more general i.e. non-necessarily polynomial, models.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

On the basins of attraction of a one-dimensional family of root finding algorithms, from Newton to Traub

  • Canela Sánchez, Jordi|||0000-0001-7879-5438
  • Evdoridou, Vasiliki|||0000-0002-5409-2663
  • Garijo, Antoni|||0000-0002-1503-7514
  • Jarque Ribera, Xavier|||0000-0002-6576-9780
In this paper we study the dynamics of damped Traub's methods T when applied to polynomials. The family of damped Traub's methods consists of root finding algorithms which contain both Newton's (δ= 0) and Traub's method (δ= 1). Our goal is to obtain several topological properties of the basins of attraction of the roots of a polynomial p under T, which are used to determine a (universal) set of initial conditions for which convergence to all roots of p can be guaranteed. We also numerically explore the global properties of the dynamical plane for T to better understand the connection between Newton's method and Traub's method.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Dynamics of the Secant map near infinity

  • Garijo, Antoni|||0000-0002-1503-7514
  • Jarque Ribera, Xavier|||0000-0002-6576-9780
We investigate the root finding algorithm given by the Secant method applied to a real polynomial p of degree k as a discrete dynamical system defined on R2. We extend the Secant map to the real projective plane RP2. The line at infinity ℓ∞ is invariant, and there is one (if k is odd) or two (if k is even) fixed points at ℓ∞. We show that these are of saddle type, and this allows us to better understand the dynamics of the Secant map near infinity.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Dynamics of Newton-like root finding methods

  • Campos, Beatriz|||0000-0001-9205-0256
  • Canela Sánchez, Jordi|||0000-0001-7879-5438
  • Vindel, Pura|||0000-0001-8422-4738
When exploring the literature, it can be observed that the operator obtained when applying Newton-like root finding algorithms to the quadratic polynomials z - c has the same form regardless of which algorithm has been used. In this paper, we justify why this expression is obtained. This is done by studying the symmetries of the operators obtained after applying Newton-like algorithms to a family of degree d polynomials p(z) = z - c. Moreover, we provide an iterative procedure to obtain the expression of new Newton-like algorithms. We also carry out a dynamical study of the given generic operator and provide general conclusions of this type of methods.