Pura Vindel

Pura Vindel

Auto-generated profile, based on publicly available information

Pura Vindel

Universitat Jaume I

Research Focus & Metrics

Academic Career Length

41Years (1986-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2013 in Applied Mathematics Letters
Verified
Journal Article
Closed access
Alicia CorderoAlicia Cordero
Alicia Cordero
JMJavier García Maimó
Javier García Maimó
Juan R. TorregrosaJuan R. Torregrosa
Juan R. Torregrosa
MVMaria P. Vassileva
Maria P. Vassileva
PVPura Vindel
Pura Vindel

1 April 2013 in Applied Mathematics and Computation
Verified
Journal Article
Open access
Alicia CorderoAlicia Cordero
Alicia Cordero
Juan R. TorregrosaJuan R. Torregrosa
Juan R. Torregrosa
PVPura Vindel
Pura Vindel
In this paper, the dynamics of the Chebyshev–Halley family is studied on quadratic polynomials. A singular set, that we call cat set, appears in the parameter space associated to the family. This set has interesting similarities with the Mandelbrot set. The parameter space has allowed us to find different elements of the family which have bad convergence properties, since periodic orbits and attractive strange fixed points appear in the dynamical plane of the corresponding metho

1 July 2017 in Journal of Computational and Applied Mathematics
Verified
Journal Article
Closed access
BCBeatriz Campos
Beatriz Campos
Alicia CorderoAlicia Cordero
Alicia Cordero
Juan R. TorregrosaJuan R. Torregrosa
Juan R. Torregrosa
PVPura Vindel
Pura Vindel

1 November 2015 in Applied Mathematics and Computation
Verified
Journal Article
Closed access
BCBeatriz Campos
Beatriz Campos
Alicia CorderoAlicia Cordero
Alicia Cordero
Juan R. TorregrosaJuan R. Torregrosa
Juan R. Torregrosa
PVPura Vindel
Pura Vindel

15 December 2022 in Numerical Algorithms
Verified
Journal Article
Open access
PDF file
BCB. Campos
B. Campos
JCJ. Canela
J. Canela
PVP. Vindel
P. Vindel
When exploring the literature, it can be observed that the operator obtained when applying Newton-like root finding algorithms to the quadratic polynomials z2 − 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) = zd − 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.

1 March 2020 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
BCB. Campos
B. Campos
JCJ. Canela
J. Canela
PVP. Vindel
P. Vindel