An effective algorithm to compute Mandelbrot sets in parameter planes.

Publication date

2018-09-28T08:32:21Z

2018-09-28T08:32:21Z

2017-01-01

2018-09-28T08:32:21Z

Abstract

McMullen in 2000 proved that copies of generalized Mandelbrot set are dense in the bifurcation locus for generic families of rational maps. We develop an algorithm to an effective computation of the location and size of these generalized Mandelbrot sets in parameter space. We illustrate the effectiveness of the algorithm by applying it to concrete families of rational and entire maps.

Document Type

Article


Accepted version

Language

English

Publisher

Springer Verlag

Related items

Versió postprint del document publicat a: https://doi.org/10.1007/s11075-017-0270-8

Numerical Algorithms, 2017, vol. 76, num. 2, p. 555-571

https://doi.org/10.1007/s11075-017-0270-8

Recommended citation

This citation was generated automatically.

Rights

(c) Springer Verlag, 2017

This item appears in the following Collection(s)