Solving the quintic by iteration
DOI10.1007/BF02392735zbMath0705.65036OpenAlexW2102665077WikidataQ56864859 ScholiaQ56864859MaRDI QIDQ918135
Curtis T. McMullen, Peter G. Doyle
Publication date: 1989
Published in: Acta Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02392735
attractorsNewton's methodGalois groupiterative algorithmsalgebraic equationsquintic equationgenerally convergent algorithmsicosahedral equationtower of algorithms
Generalizations of solvable and nilpotent groups (20F19) Equations in general fields (12E12) Numerical computation of solutions to single equations (65H05) Simple groups: alternating groups and groups of Lie type (20D06)
Related Items (37)
Cites Work
- On the existence of generally convergent algorithms
- Families of rational maps and iterative root-finding algorithms
- Braiding of the attractor and the failure of iterative algorithms
- $ K$-COHOMOLOGY OF SEVERI-BRAUER VARIETIES AND THE NORM RESIDUE HOMOMORPHISM
- On the efficiency of algorithms of analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving the quintic by iteration