论文信息 - Braiding of the attractor and the failure of iterative algorithms

Braiding of the attractor and the failure of iterative algorithms

Le mouvement de l'attracteur dans une famille stable d'applications rationnelles determine un groupe de tresses sur la sphere de Riemann. On montre que le groupe correspondant des classes d'application est soit reductible, soit fini, soit fixe l'un des attracteurs. Ceci conduit a un critere topologique d'existence des bifurcations dans les algorithmes iteratifs de recherche de racines bases sur des applications rationnels

C. McMullen

[1] J. Birman. Braids, Links, and Mapping Class Groups. , 1975 .

[2] Joan S. Birman,et al. Braids, Links, and Mapping Class Groups. (AM-82) , 1975 .

[3] W. Magnus,et al. Review: Joan S. Birman, Braids, links, and mapping class groups , 1976 .

[4] Heiner Zieschang,et al. Finite Groups of Mapping Classes of Surfaces , 1981 .

[5] Steven P. Kerckho,et al. The Nielsen realization problem , 1983 .

[6] D. Sullivan,et al. On the dynamics of rational maps , 1983 .

[7] D. Sullivan. Conformal dynamical systems , 1983 .

[8] The Nielsen Realization Problem , 1983 .

[9] Jane Gilman. Structures of Elliptic Irreducible Subgroups of the Modular Group , 1983 .

[10] P. Blanchard. Complex analytic dynamics on the Riemann sphere , 1984 .

[11] S. Smale. On the efficiency of algorithms of analysis , 1985 .

[12] W. Thurston,et al. Extending holomorphic motions , 1986 .

[13] L. Bers,et al. Holomorphic families of injections , 1986 .

[14] Stephen Smale,et al. On the existence of generally convergent algorithms , 1986, J. Complex..

[15] C. McMullen. Families of Rational Maps and Iterative Root-Finding Algorithms , 1987 .

[16] C. McMullen. Automorphisms of rational maps , 1988 .

[17] C. McMullen,et al. Solving the quintic by iteration , 1989 .