Now showing items 1-5 of 5

    • openAccess   Dynamics of a Family of Rational Operators of Arbitrary Degree 

      Campos, Beatriz; Canela, Jordi; Garijo, Antonio; Vindel, Pura Vilnius Gediminas Technical University (2021-05-26)
      . In this paper we analyse the dynamics of a family of rational operators coming from a fourth-order family of root-finding algorithms. We first show that it may be convenient to redefine the parameters to prevent ...
    • openAccess   Dynamics of Newton method for symmetric quartic polynomial 

      Campos, Beatriz; Garijo, Antonio; Jarque, Xavier; Vindel, Pura Sociedad Española de Matemática Aplicada (SEMA) (2017-06-26)
      We consider the Newton method on symmetric quartic polynomials. The parameter space is divided into different regions with different dynamical behaviours. In this paper, we study the dynamics for values of the parameter ...
    • openAccess   Newton method for symmetric quartic polynomial 

      Campos, Beatriz; Garijo, Antonio; Jarque, Xavier; Vindel, Pura Elsevier (2016-11)
      We investigate the parameter plane of the Newton’s method applied to the family of quartic polynomials pa,b(z)=z4+az3+bz2+az+1,pa,b(z)=z4+az3+bz2+az+1, where a and b are real parameters. We divide the parameter plane ...
    • openAccess   On a family of rational perturbations of the doubling map 

      Canela, Jordi; Fagella, Núria; Garijo, Antonio Taylor and Francis (2015-06-17)
      The goal of this paper is to investigate the parameter plane of a rational family of perturbations of the doubling map given by the Blaschke products Ba(z) = z 3 z−a 1−az¯ . First we study the basic properties of these ...
    • openAccess   On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub 

      Canela, Jordi; Evdoridou, Vasiliki; Garijo, Antonio; Jarque, Xavier Springer (2023)
      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 ...