An effective algorithm to compute Mandelbrot sets in parameter planes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3879236 (Why is no real title available?)
- scientific article; zbMATH DE number 739003 (Why is no real title available?)
- scientific article; zbMATH DE number 2096491 (Why is no real title available?)
- scientific article; zbMATH DE number 1432032 (Why is no real title available?)
- Complex dynamics
- Dynamics in One Complex Variable. (AM-160)
- Newton's method on Bring-Jerrard polynomials
- On the dynamics of polynomial-like mappings
- The parameter planes of z^m (z) for m 2
Cited in
(9)- A count of maximal small copies in Multibrot sets
- Algorithms for classifying points in a 2-adic Mandelbrot set
- ALGORITHM FOR EXTERNAL ARGUMENTS CALCULATION OF THE NODES OF A SHRUB IN THE MANDELBROT SET
- A fast construction of generalized Mandelbrot sets using main components with epicycloidal boundaries
- scientific article; zbMATH DE number 2096491 (Why is no real title available?)
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Parameter space of one-parameter complex mappings
- Relating singularly perturbed rational maps to families of entire maps
- COMPOSED ACCELERATED ESCAPE TIME ALGORITHM TO CONSTRUCT THE GENERAL MANDELBROT SETS
This page was built for publication: An effective algorithm to compute Mandelbrot sets in parameter planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678595)