The Medusa Algorithm for Polynomial Matings

Details The Medusa Algorithm for Polynomial Matings The Medusa Algorithm for Polynomial Matings

2011-02-24

arxiv.org/abs/1102.5047v1

Mathematics

Dynamical Systems

25 pages, many figures, submitted

Scientific paper

The Medusa algorithm takes as input two postcritically finite quadratic polynomials and outputs the quadratic rational map which is the mating of the two polynomials (if it exists). Specifically, the output is a sequence of approximations for the parameters of the rational map, as well as an image of its Julia set. Whether these approximations converge is answered using Thurston's topological characterization of rational maps. This algorithm was designed by John Hamal Hubbard, and implemented in 1998 by Christian Henriksen and REU students David Farris, and Kuon Ju Liu. In this paper we describe the algorithm and its implementation, discuss some output from the program (including many pictures) and related questions. Specifically, we include images and a discussion for some shared matings, Lattes examples, and tuning sequences of matings.

Affiliated with

Also associated with

No associations

Rating

The Medusa Algorithm for Polynomial Matings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Medusa Algorithm for Polynomial Matings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Medusa Algorithm for Polynomial Matings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87129