arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1102.5047math.DS
收藏

多项式配对的美杜莎算法

The Medusa Algorithm for Polynomial Matings

Suzanne Hruska Boyd, Christian Henriksen

AI总结:

本文介绍美杜莎算法,用于计算两个后临界有限二次多项式的配对有理映射,并讨论其实现、收敛性判定及若干实例图像。

摘要:

美杜莎算法以两个后临界有限二次多项式为输入,并输出作为这两个多项式配对(若存在)的二次有理映射。具体而言,输出是有理映射参数的一系列近似值,以及其朱利亚集的图像。这些近似值是否收敛,可通过瑟斯顿关于有理映射的拓扑刻画来回答。该算法由约翰·哈马尔·哈伯德设计,并于1998年由克里斯蒂安·亨里克森及REU学生大卫·法里斯和邝巨流实现。在本文中,我们描述了该算法及其实现,讨论了程序的一些输出(包括许多图片)及相关问题。具体来说,我们收录了一些共享配对、拉特斯例子以及配对调谐序列的图像和讨论。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑