Purely Iterative Algorithms for Newton’s Maps and General Convergence
Keyword(s):
The aim of this paper is to study the local dynamical behaviour of a broad class of purely iterative algorithms for Newton’s maps. In particular, we describe the nature and stability of fixed points and provide a type of scaling theorem. Based on those results, we apply a rigidity theorem in order to study the parameter space of cubic polynomials, for a large class of new root finding algorithms. Finally, we study the relations between critical points and the parameter space.
2010 ◽
Vol 52
(9-10)
◽
pp. 1697-1705
◽
1986 ◽
pp. 169-179
◽
2020 ◽
Vol 498
(3)
◽
pp. 3403-3419
Keyword(s):
1992 ◽
Vol 46
(1)
◽
pp. 107-113
◽
Keyword(s):
1997 ◽
Vol 40
(1)
◽
pp. 19-30
◽
2010 ◽
Vol 41
(5)
◽
pp. 365-369
◽
2011 ◽
Vol 382
(2)
◽
pp. 631-644
◽
1993 ◽
Vol 03
(04)
◽
pp. 921-941
◽