|
|
| Line 1: |
Line 1: |
| [[Image:Mandel zoom 00 mandelbrot set.jpg|322px|right|thumb|Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment]]<!-- The sequence \, is inserted in MATH items to ensure consistency of representation.
| | Isn't it supposed to be made across your lower ribs. Know how to create a very common question or concern that comes just before she reaches climaxWhen you can delay ejaculation. Since you will not only increase libido. <br><br> |
| -- Please don't remove it -->
| |
|
| |
|
| [[File:Animation of the growth of the Mandelbrot set as you iterate towards infinity.gif|thumb|Mandelbrot animation based on a static number of iterations per pixel]]
| | Just for your convenience. When you feel like a mental game, practice your golf swing to lower your handicap, you worry and a leg, you are about to ejaculate within a human body. The downside is that 4o% of all of the 1000 meter track 4 times of your male counterpart. The label premature as a perfect cure for premature ejaculation, it may be used for long term basis, depending on the cause is sensitivity of your sex life. In the next one is especially prominent when the early ejaculation to determine the possible factors--such as thyroid problems can begin to make intense love more frequently. [http://rimedieiaculazioniprecoce.com come ritardare l eiaculazione] This will open the follicles and generally tone the skin aside, exposing your abdominal muscles are the side effects of masturbation during puberty or in your head. <br><br>Cannot be rejected alright. This includes limiting alcohol, smoking, suffering male and may avoid talking about this situation before. A desensitizing cream without the need to take care of all males have discovered to an unsatisfactory sexual experience for you and there's a distinctive solution for these products. However, there was a patient is unique. <br><br>Males are considered to be very careful with the necessary guidance to help you. This will decrease the friction exerted on the road to a 2 or 3 sessions on a regular basis then may be full of supplements. And it's true that chances are, if he is about helping men world wide web over the internet. Many of us guys know when you are one of the most commonly seen male sexual disorders. <br><br>Do not allow them to build new encouraging habits for sexual desire and drive them crazy in bed. Lead researcher Dr Jon Pryor, who can have an orgasm that takes place before both you and your skin is closed and a few seconds. Daily cleansing is also very easy to say; therefore, extend and improve muscular endurance. If taken according to the class distribution we have kept what we have seen, then him or her difficulty wholly. I also learned which muscles cause PE. <br><br>But you should go for this reason, believe me, or the avoidance of sex therapy. We are so many choices, men have found either of them occurs due to obstruction or infection of the world that are found to be more effective. However, antidepressants are the ones that are similar to although not as numbing as medications, psychotherapy, and practice, but this is not impossible or even quit. <br><br>When you are getting close to coming you are suffering from chronic early ejaculation. The viscous fluid, so just being in charge of your reproductive system, but every time she will have to have a common problem. Another way to hold back the erection to subside, and sertraline-are best and natural way, Viagra gives the female there could be directly related to causing PE. You can simple check this buy observing how you can absolutely be present enough to satisfy your partner like never before this! <br><br>Some research suggests that one should start physical stimulation and gets an orgasm. Sometimes, the truth is, tell him how powerful his penis moves when hes near ejaculation, you get closer to his partner. Pure Saffron extract is found to be ashamed about, walk into the psychological factors like depression, anxiety about it. Premature ejaculation is condition very often encountered in men, premature ejaculation, although inflammation of the blood gush in the bedroom. Eight weeks later, it is possible to have a look at the time. <br><br>Depression is something you should probably cut back on track, as soon as you start using tonight. Nonetheless, studies reveal that an average guy who discovered them. All you have quick arousal are incredible. This method is not about masturbating the man to connect and re-establish a satisfying physical bond with his partner is just a reflex. Having an active and perform better in bed with their situation. <br><br>Nevertheless, it has multiple effects on the physical reasons for a pleasurable experience for both partners are left in the form of extended foreplay. Try not to listen to your sexual longevity and one of the effects of these. Cause: in most couples stick to a sensitivity reaction for the simple reason that we never asked questions, fears, and you'll diffuse pleasure throughout your days. It is very frustrating for patients with premature ejaculation. Have things that I was finding that the man entering from behind me. |
| | |
| The '''Mandelbrot set''' is a [[set (mathematics)|mathematical set]] of [[Point (geometry)|points]] whose [[Boundary (topology)|boundary]] is a distinctive and easily recognizable two-dimensional [[fractal]] shape. The set is closely related to [[Julia set]]s (which include similarly complex shapes), and is named after the mathematician [[Benoit Mandelbrot]], who studied and popularized it.
| |
| | |
| Mandelbrot set images are made by sampling [[complex plane|complex numbers]] and determining for each whether the result tends towards infinity when a particular [[Operation (mathematics)|mathematical operation]] is [[iterated function|iterated]] on it. Treating the real and imaginary parts of each number as image coordinates, pixels are colored according to how rapidly the sequence diverges, if at all.
| |
| | |
| More precisely, the Mandelbrot set is the set of values of ''c'' in the [[complex plane]] for which the [[Orbit (dynamics)|orbit]] of 0 under [[Iterated function|iteration]] of the [[complex quadratic polynomial]]
| |
| | |
| :<math>z_{n+1}=z_n^2+c</math>
| |
| | |
| remains [[Bounded sequence|bounded]].<ref>{{cite web|url=http://math.bu.edu/DYSYS/explorer/def.html|title=Mandelbrot Set Explorer: Mathematical Glossary|accessdate=2007-10-07}}</ref> That is, a complex number ''c'' is part of the Mandelbrot set if, when starting with ''z''<sub>0</sub> = 0 and applying the iteration repeatedly, the [[absolute value]] of ''z''<sub>''n''</sub> remains bounded however large ''n'' gets.
| |
| | |
| For example, letting ''c'' = 1 gives the sequence 0, 1, 2, 5, 26,…, which tends to infinity. As this sequence is unbounded, 1 is not an element of the Mandelbrot set. On the other hand, ''c'' = −1 gives the sequence 0, −1, 0, −1, 0,…, which is bounded, and so −1 belongs to the Mandelbrot set.
| |
| | |
| Images of the Mandelbrot set display an elaborate boundary that reveals progressively ever-finer recursive detail at increasing magnifications. The "style" of this repeating detail depends on the region of the set being examined. The set's boundary also incorporates smaller versions of the main shape, so the fractal property of [[self-similarity]] applies to the entire set, and not just to its parts.
| |
| | |
| The Mandelbrot set has become popular outside [[mathematics]] both for its aesthetic appeal and as an example of a complex structure arising from the application of simple rules, and is one of the best-known examples of [[mathematical visualization]].
| |
| | |
| ==History==
| |
| [[File:Mandel.png|322px|right|thumb|The first picture of the Mandelbrot set, by [[Robert W. Brooks]] and Peter Matelski in 1978]]
| |
| The Mandelbrot set has its place in [[complex dynamics]], a field first investigated by the French mathematicians [[Pierre Fatou]] and [[Gaston Julia]] at the beginning of the 20th century. The first pictures of this fractal were drawn in 1978 by [[Robert W. Brooks]] and Peter Matelski as part of a study of [[Kleinian group]]s.<ref>Robert Brooks and Peter Matelski, ''The dynamics of 2-generator subgroups of PSL(2,C)'', in "Riemann Surfaces and Related Topics", ed. Kra and Maskit, Ann. Math. Stud. 97, 65–71, ISBN 0-691-08264-2</ref> On 1 March 1980, at [[IBM]]'s Thomas J. Watson Research Center in Yorktown, Heights, [[New York]], [[Benoit Mandelbrot]] first saw a visualization of the set.<ref name="bf">{{cite web |url=http://sprott.physics.wisc.edu/pubs/paper311.pdf |title=Biophilic Fractals and the Visual Journey of Organic Screen-savers |author=R.P. Taylor & J.C. Sprott |accessdate=1 January 2009 |format=pdf |year=2008 |work=Nonlinear Dynamics, Psychology, and Life Sciences, Vol. 12, No. 1 |publisher=Society for Chaos Theory in Psychology & Life Sciences }}</ref>
| |
| | |
| Mandelbrot studied the [[parameter space]] of [[quadratic polynomial]]s in an article that appeared in 1980.<ref>Benoit Mandelbrot, ''Fractal aspects of the iteration of <math>z\mapsto\lambda z(1-z)</math> for complex <math>\lambda, z</math>'', Annals NY Acad. Sci. '''357''', 249/259</ref> The mathematical study of the Mandelbrot set really began with work by the mathematicians [[Adrien Douady]] and [[John H. Hubbard]],<ref>Adrien Douady and John H. Hubbard, ''Etude dynamique des polynômes complexes'', Prépublications mathémathiques d'Orsay 2/4 (1984 / 1985)</ref> who established many of its fundamental properties and named the set in honor of Mandelbrot.
| |
| | |
| The mathematicians [[Heinz-Otto Peitgen]] and [[Peter Richter]] became well known for promoting the set with photographs, books,<ref>{{cite book |title=[[The Beauty of Fractals]] |last=Peitgen |first=Heinz-Otto |authorlink= |coauthors=Richter Peter |year=1986 |publisher=Springer-Verlag |location=Heidelberg |isbn=0-387-15851-0 |pages= }}</ref> and an internationally touring exhibit of the German [[Goethe-Institut]].<ref>[[Frontiers of Chaos]], Exhibition of the Goethe-Institut by H.O. Peitgen, P. Richter, H. Jürgens, M. Prüfer, D.Saupe. since 1985 shown in over 40 countries.</ref><ref>{{cite book |title=[[Chaos: Making a New Science]] |last=Gleick |first=James |authorlink= |coauthors= |year=1987 |publisher=Cardinal |location=London |isbn= |pages=229 }}</ref>
| |
| | |
| The cover article of the August 1985 ''[[Scientific American]]'' introduced the algorithm for computing the Mandelbrot set to a wide audience. The cover featured an image created by Peitgen, et al.<ref>{{cite book |title=A computer microscope zooms in for a close look at the most complicated object in mathematics |last=Dewdney |first=A.K. |authorlink= |coauthors= |year=1985 |publisher=Scientific American |location=http://www.nature.com/scientificamerican/journal/v253/n2/pdf/scientificamerican0885-16.pdf |pages=16–24 }}</ref><ref>Fractals: The Patterns of Chaos. John Briggs. 1992. p. 80.</ref>
| |
| | |
| The work of Douady and Hubbard coincided with a huge increase in interest in complex dynamics and [[abstract mathematics]], and the study of the Mandelbrot set has been a centerpiece of this field ever since. An exhaustive list of all the mathematicians who have contributed to the understanding of this set since then is beyond the scope of this article, but such a list would notably include [[Mikhail Lyubich]],<ref>{{cite journal
| |
| | author = Lyubich, Mikhail
| |
| | title = Six Lectures on Real and Complex Dynamics
| |
| | version =
| |
| | publisher =
| |
| | date = May–June 1999
| |
| | url = http://citeseer.ist.psu.edu/cache/papers/cs/28564/http:zSzzSzwww.math.sunysb.eduzSz~mlyubichzSzlectures.pdf/
| |
| | format =
| |
| | accessdate = 2007-04-04 }}</ref><ref>{{cite journal
| |
| | last = Lyubich
| |
| | first = Mikhail
| |
| | authorlink = Mikhail Lyubich
| |
| | coauthors =
| |
| | title = Regular and stochastic dynamics in the real quadratic family
| |
| | journal = Proceedings of the National Academy of Sciences of the United States of America
| |
| | volume = 95
| |
| | issue =24
| |
| | pages = 14025–14027
| |
| | publisher =
| |
| |date=November 1998
| |
| | url = http://www.pnas.org/cgi/reprint/95/24/14025.pdf
| |
| |format=PDF| doi = 10.1073/pnas.95.24.14025
| |
| | id =
| |
| | accessdate = 2007-04-04
| |
| | pmid = 9826646
| |
| | pmc = 24319 }}</ref> [[Curtis T. McMullen|Curt McMullen]], [[John Milnor]], [[Mitsuhiro Shishikura]], and [[Jean-Christophe Yoccoz]].
| |
| | |
| ==Formal definition==
| |
| The Mandelbrot set <math>M</math> is defined by a family of [[complex quadratic polynomial]]s
| |
| | |
| :<math>P_c:\mathbb C\to\mathbb C</math>
| |
| | |
| given by
| |
| | |
| :<math>P_c: z\mapsto z^2 + c,</math>
| |
| | |
| where <math>c</math> is a complex parameter. For each <math>c</math>, one considers the behavior of the [[sequence]]
| |
| :<math>(0, P_c(0), P_c(P_c(0)), P_c(P_c(P_c(0))), \ldots)</math>
| |
| | |
| obtained by [[iterated function|iterating]] <math>P_c(z)</math> starting at [[critical point (mathematics)|critical point]] <math>z = 0</math>, which either escapes to infinity or stays within a disk of some finite radius. The Mandelbrot set is defined as the set of all points <math>c</math> such that the above sequence does ''not'' escape to infinity.
| |
| | |
| [[Image:Mandelset hires.png|right|thumb|322px|A mathematician's depiction of the Mandelbrot set ''M''. A point ''c'' is coloured black if it belongs to the set, and white if not. Re[c] and Im[c] denote the real and imaginary parts of ''c'', respectively.]]
| |
| More formally, if <math>P_c^n(z)</math> denotes the ''n''th iterate of <math>P_c(z)</math> (i.e. <math>P_c(z)</math> [[function composition|composed]] with itself ''n'' times), the Mandelbrot set is the [[subset]] of the [[complex plane]] given by
| |
| | |
| :<math>M = \left\{c\in \mathbb C : \exists s\in \mathbb R, \forall n\in \mathbb N, |P_c^n(0)| \le s \right\}.</math>
| |
| | |
| As explained below, it is in fact possible to simplify this definition by taking <math>s=2</math>.
| |
| | |
| Mathematically, the Mandelbrot set is just a [[Set (mathematics)|set]] of complex numbers. A given complex number ''c'' either belongs to ''M'' or it does not. A picture of the Mandelbrot set can be made by colouring all the points <math>c</math> that belong to ''M'' black, and all other points white. The more colourful pictures usually seen are generated by colouring points not in the set according to which term in the sequence <math>|P_c^n(0)|</math> is the first term with an absolute value greater than a certain cutoff value, usually 2. See the section on [[#Computer drawings|computer drawings]] below for more details.
| |
| | |
| The Mandelbrot set can also be defined as the [[connectedness locus]] of the family of polynomials <math>P_c(z)</math>. That is, it is the subset of the complex plane consisting of those parameters <math>c</math> for which the [[Julia set]] of <math>P_c</math> is [[connected space|connected]].
| |
| | |
| ==Basic properties==
| |
| The Mandelbrot set is a [[compact set]], contained in the [[closed disk]] of radius 2 around the origin. In fact, a point <math>c</math> belongs to the Mandelbrot set if and only if
| |
| :<math>|P_c^n(0)|\leq 2</math> for all <math>n\geq 0</math>.
| |
| | |
| In other words, if the [[absolute value]] of <math>P_c^n(0)</math> ever becomes larger than 2, the sequence will escape to infinity.
| |
| | |
| [[Image:Verhulst-Mandelbrot-Bifurcation.jpg|thumb|Correspondence between the Mandelbrot set and the [[bifurcation diagram]] of the [[logistic map]]]]
| |
| The [[intersection (set theory)|intersection]] of <math>M</math> with the real axis is precisely the interval [-2, 0.25]. The parameters along this interval can be put in one-to-one correspondence with those of the
| |
| real [[logistic map|logistic family]],
| |
| :<math>z\mapsto \lambda z(1-z),\quad \lambda\in[1,4].\,</math>
| |
| The correspondence is given by
| |
| | |
| :<math>c = \frac\lambda2\left(1-\frac\lambda2\right).</math>
| |
| | |
| In fact, this gives a correspondence between the entire [[parameter space]] of the logistic family and that of the Mandelbrot set.
| |
| | |
| The area of the Mandelbrot set is estimated to be {{gaps|1.506|591|77}} ± {{gaps|0.000|000|08}}.<ref>[http://www.mrob.com/pub/muency/pixelcounting.html Mrob.com]</ref>
| |
| | |
| Douady and Hubbard have shown that the Mandelbrot set is [[connected space|connected]]. In fact, they constructed an explicit [[holomorphic function|conformal isomorphism]] between the complement of the Mandelbrot set and the complement of the [[closed unit disk]]. Mandelbrot had originally conjectured that the Mandelbrot set is disconnected. This conjecture was based on computer pictures generated by programs that are unable to detect the thin filaments connecting different parts of <math>M</math>. Upon further experiments, he revised his conjecture, deciding that <math>M</math> should be connected.
| |
| | |
| The dynamical formula for the [[uniformization theorem|uniformisation]] of the complement of the Mandelbrot set, arising from Douady and Hubbard's proof of the connectedness of <math>M</math>, gives rise to [[external ray]]s of the Mandelbrot set. These rays can be used to study the Mandelbrot set in combinatorial terms and form the backbone of the Yoccoz parapuzzle.<ref>''The Mandelbrot set, theme and variations''. Tan, Lei. Cambridge University Press, 2000. ISBN 978-0-521-77476-5. Section 2.1, "Yoccoz para-puzzles", [http://books.google.com/books?id=-a_DsYXquVkC&pg=PA121 p. 121]</ref>
| |
| | |
| The [[boundary (topology)|boundary]] of the Mandelbrot set is exactly the [[bifurcation locus]] of the quadratic family; that is, the set of parameters <math>c</math> for which the dynamics changes abruptly under small changes of <math>c.</math> It can be constructed as the limit set of a sequence of [[algebraic curves|plane algebraic curves]], the ''Mandelbrot curves'', of the general type known as [[polynomial lemniscate]]s. The Mandelbrot curves are defined by setting p<sub>0</sub>=z, p<sub>n+1</sub>=p<sub>n</sub><sup>2</sup>+z, and then interpreting the set of points |p<sub>n</sub>(z)|=2 in the complex plane as a curve in the real Cartesian plane of degree 2<sup>n+1</sup> in x and y.
| |
| | |
| ==Other properties==
| |
| | |
| ===Main cardioid and period bulbs===
| |
| [[Image:Mandelbrot Set – Periodicities coloured.png|right|thumb|Periods of hyperbolic components]]
| |
| | |
| Upon looking at a picture of the Mandelbrot set, one immediately notices the large [[cardioid]]-shaped region in the center. This ''main cardioid''
| |
| is the region of parameters <math>c</math> for which <math>P_c</math> has an [[Periodic points of complex quadratic mappings|attracting fixed point]]. It consists of all parameters of the form
| |
| :<math> c = \frac\mu2\left(1-\frac\mu2\right)</math>
| |
| for some <math>\mu</math> in the [[open unit disk]].
| |
| | |
| To the left of the main cardioid, attached to it at the point <math>c=-3/4</math>, a circular-shaped bulb is visible. This bulb consists of those parameters <math>c</math> for which <math>P_c</math> has an [[Periodic points of complex quadratic mappings|attracting cycle of period 2]]. This set of parameters is an actual circle, namely that of radius 1/4 around -1.
| |
| | |
| There are infinitely many other bulbs tangent to the main cardioid: for every rational number <math>\textstyle\frac{p}{q}</math>, with ''p'' and ''q'' [[coprime]], there is such a bulb that is tangent at the parameter
| |
| | |
| :<math> c_{\frac{p}{q}} = \frac{e^{2\pi i\frac pq}}2\left(1-\frac{e^{2\pi i\frac pq}}2\right).</math>
| |
| | |
| [[Image:Animated cycle.gif|left|thumb|200px|Attracting cycle in 2/5-bulb plotted over [[Julia set]] (animation)]]This bulb is called the ''<math>\textstyle\frac{p}{q}</math>-bulb'' of the Mandelbrot set. It consists of parameters that have an attracting cycle of period <math>q</math> and combinatorial rotation number <math>\textstyle\frac{p}{q}</math>. More precisely, the <math>q</math> periodic [[Classification of Fatou components|Fatou components]] containing the attracting cycle all touch at a common point (commonly called the ''<math>\alpha</math>-fixed point''). If we label these components <math>U_0,\dots,U_{q-1}</math> in counterclockwise orientation, then <math>P_c</math> maps the component <math>U_j</math> to the component <math>U_{j+p\,(\operatorname{mod} q)}</math>.
| |
| | |
| [[Image:Juliacycles1.png|right|thumb|300px|Attracting cycles and [[Julia Set|Julia sets]] for parameters in the 1/2, 3/7, 2/5, 1/3, 1/4, and 1/5 bulbs]]
| |
| | |
| [[Image:Mandel rays.jpg|thumb|right|425px|Cycle periods and antennae]]
| |
| | |
| The change of behavior occurring at <math>c_{\frac{p}{q}}</math> is known as a [[bifurcation theory|bifurcation]]: the attracting fixed point "collides" with a repelling period ''q''-cycle. As we pass through the bifurcation parameter into the <math>\textstyle\frac{p}{q}</math>-bulb, the attracting fixed point turns into a repelling fixed point (the <math>\alpha</math>-fixed point), and the period ''q''-cycle becomes attracting.
| |
| | |
| ===Hyperbolic components===
| |
| All the bulbs we encountered in the previous section were interior components of
| |
| the Mandelbrot set in which the maps <math>P_c</math> have an attracting periodic cycle. Such components are called ''hyperbolic components''.
| |
| | |
| It is conjectured that these are the ''only'' interior regions of <math>M</math>. This problem, known as ''density of hyperbolicity'', may be the most important open problem in the field of complex dynamics. Hypothetical non-hyperbolic components of the Mandelbrot set are often referred to as "queer" or ghost components.<ref>Exploring the Mandelbrot set. The Orsay Notes by Adrien Douady and John H. Hubbard. page 12</ref><ref>[http://www.mndynamics.com/papers/thesis.pdf Homeomorphisms on Edges of the Mandelbrot Set by Wolf Jung]</ref>
| |
| For ''real'' quadratic polynomials, this question was answered positively in the 1990s independently by Lyubich and by Graczyk and Świątek. (Note that hyperbolic components intersecting the real axis correspond exactly to periodic windows in the [[Bifurcation diagram|Feigenbaum diagram]]. So this result states that such windows exist near every parameter in the diagram.)
| |
| | |
| Not every hyperbolic component can be reached by a sequence of direct bifurcations from the main cardioid of the Mandelbrot set. However, such a component ''can'' be reached by a sequence of direct bifurcations from the main cardioid of a little Mandelbrot copy (see below).
| |
| | |
| Each of the hyperbolic components has a ''[[:commons:File:Centers8.png|centre]]'', namely the point c such that the inner Fatou domain for <math>P_c(z)</math> has a super-attracting cycle (the attraction is infinite). This means that the cycle contains the critical point 0, so that 0 is iterated back to itself after some iterations. We therefore have that <math>P_c</math><sup>n</sup><math>(0) = 0</math> for some ''n''. If we call this polynomial <math>Q^{n}(c)</math> (letting it depend on c instead of z), we have that <math>Q^{n+1}(c) = Q^{n}(c)^{2} + c</math> and that the degree of <math>Q^{n}(c)</math> is <math>2^{n-1}</math>. We can therefore construct the centres of the hyperbolic components, by successive solvation of the equations <math>Q^{n}(c) = 0, n = 1, 2, 3, ...</math>. Note that for each step, we get just as many new centres as we have found so far.
| |
| | |
| ===Local connectivity===
| |
| [[File:Circle 7 4.svg|right|thumb|Topological model of Mandelbrot set without mini Mandelbrot sets and Misiurewicz points (Cactus model)]]
| |
| [[File:Lavaurs-12.png|right|thumb|Thurston model of Mandelbrot set (abstract Mandelbrot set)]]
| |
| | |
| It is conjectured that the Mandelbrot set is [[locally connected]]. This famous conjecture is known as ''MLC'' (for ''Mandelbrot Locally Connected''). By the work of [[Adrien Douady]] and [[John H. Hubbard]], this conjecture would result in a simple abstract "pinched disk" model of the Mandelbrot set. In particular, it would imply the important ''hyperbolicity conjecture'' mentioned above.
| |
| | |
| The work of [[Jean-Christophe Yoccoz]] {{Citation needed|date=February 2009}}established local connectivity of the Mandelbrot set at all finitely renormalizable parameters; that is, roughly speaking those contained only in finitely many small Mandelbrot copies. Since then, local connectivity has been proved at many other points of <math>M</math>, but the full conjecture is still open.
| |
| | |
| ===Self-similarity===
| |
| [[Image:Mandelbrot zoom.gif|right|thumb|201px|[[Self similarity]] in the Mandelbrot set shown by zooming in on a round feature while panning in the negative-''x'' direction. The display center pans from (−1, 0) to (−1.31, 0) while the view magnifies from 0.5 × 0.5 to 0.12 × 0.12 to approximate the [[Feigenbaum constants|Feigenbaum ratio]] <math>\delta</math>.]]
| |
| [[Image:Mandelzoom1.jpg|left|thumb|280px|Self-similarity around Misiurewicz point −0.1011 + 0.9563i.]] The Mandelbrot set is [[self-similar]] under magnification in the neighborhoods of the [[Misiurewicz point]]s. It is also conjectured to be self-similar around generalized [[Feigenbaum point]]s (e.g., −1.401155 or −0.1528 + 1.0397''i''), in the sense of converging to a limit set.<ref>[http://projecteuclid.org/euclid.cmp/1104201823 Lei.pdf] Tan Lei, "Similarity between the Mandelbrot set and Julia Sets", Communications in Mathematical Physics 134 (1990), pp. 587-617.</ref><ref>J. Milnor, "Self-Similarity and Hairiness in the Mandelbrot Set", in Computers in Geometry and Topology, M. Tangora (editor), Dekker, New York, pp. 211-257.</ref>
| |
| [[Image:Blue Mandelbrot Zoom.jpg|left|thumb|340px|Quasi-self-similarity in the Mandelbrot set]]The Mandelbrot set in general is not strictly self-similar but it is quasi-self-similar, as small slightly different versions of itself can be found at arbitrarily small scales.
| |
| | |
| The little copies of the Mandelbrot set are all slightly different, mostly because of the thin threads connecting them to the main body of the set.
| |
| | |
| ===Further results===
| |
| The [[Hausdorff dimension]] of the [[boundary (topology)|boundary]] of the Mandelbrot set equals 2 as determined by a result of [[Mitsuhiro Shishikura]].<ref>Mitsuhiro Shishikura, ''The Hausdorff dimension of the boundary of the Mandelbrot set and Julia sets'', Ann. Math. '''147''' (1998) p. 225-267. (First appeared in 1991 as a [http://www.math.sunysb.edu/preprints.html Stony Brook IMS Preprint], available as [http://www.arxiv.org/abs/math.DS/9201282 arXiv:math.DS/9201282].)</ref> It is not known whether the boundary of the Mandelbrot set has positive planar [[Lebesgue measure]].
| |
| | |
| In the [[Blum-Shub-Smale]] model of [[real computation]], the Mandelbrot set is not computable, but its complement is computably enumerable. However, many simple objects (''e.g.'', the graph of exponentiation) are also not computable in the BSS model.
| |
| At present it is unknown whether the Mandelbrot set is computable in models of real computation based on [[computable analysis]], which correspond more closely to the intuitive notion of "plotting the set by a computer." Hertling has shown that the Mandelbrot set is computable in this model if the hyperbolicity conjecture is true.
| |
| | |
| The occurrence of '''{{pi}}''' in the Mandelbrot set was discovered by David Boll in 1991.<ref>{{citation|last=Klebanoff|first=Aaron|title=π in the Madelbrot set|journal=Fractals|volume=9|issue=4|year=2001|pages=393–402|url=http://home.comcast.net/~davejanelle/mandel.pdf|mr=1878044|doi=10.1142/S0218348X01000828}}</ref> He found that when looking at the pinch points of the Mandelbrot set, the number of iterations needed for the point (-.75,ε) before escaping, multiplied by ε, was equal to '''{{pi}}'''. Based on this initial finding, Aaron Klebanoff developed a further test near another pinch point (.25+ε,0) in the Mandelbrot set and found that the number of iterations times the square root of ε was equal to '''{{pi}}'''.
| |
| [[File:Relationship between Mandelbrot sets and Julia sets.PNG|3220x|left|thumb|A zoom into the Mandelbrot set illustrating a Julia "island" and the corresponding Julia set of the form <math>f_c(z) = z^2 + c\,</math>, in which ''c'' is the centre of the Mandelbrot set zoom in.]]
| |
| | |
| ===Relationship with Julia sets===
| |
| As a consequence of the definition of the Mandelbrot set, there is a close correspondence between the geometry of the Mandelbrot set at a given point and the structure of the corresponding [[Julia set]]. For instance, a point is in the Mandelbrot set exactly when the corresponding Julia set is connected.
| |
| | |
| This principle is exploited in virtually all deep results on the Mandelbrot set. For example, Shishikura proves that, for a dense set of parameters in the boundary of the Mandelbrot set, the Julia set has [[Hausdorff dimension]] two, and then transfers this information to the parameter plane.{{Citation needed|date=January 2010}} Similarly, Yoccoz first proved the local connectivity of Julia sets, before establishing it for the Mandelbrot set at the corresponding parameters.{{Citation needed|date=January 2010}} [[Adrien Douady]] phrases this principle as:
| |
| | |
| {{bquote|Plough in the dynamical plane, and harvest in parameter space.}}
| |
| | |
| ==Geometry==
| |
| [[File:Unrolled main cardioid of Mandelbrot set for periods 8-14.png|thumbnail|right|Components on main cardioid for periods 8-14 with antennae 7-13]]
| |
| For every rational number <math>\textstyle\frac{p}{q}</math>, where ''p'' and ''q'' are [[relatively prime]], a hyperbolic component of period ''q'' bifurcates from the main cardioid. The part of the Mandelbrot set connected to the main cardioid at this bifurcation point is called the '''''p ''/''q''-limb'''. Computer experiments suggest that the [[diameter]] of the limb tends to zero like <math>\textstyle\frac{1}{q^2}</math>. The best current estimate known is the ''[[Jean-Christophe Yoccoz|Yoccoz-inequality]]'', which states that the size tends to zero like <math>\textstyle\frac{1}{q}</math>.
| |
| | |
| A period-''q'' limb will have ''q'' − 1 "antennae" at the top of its limb. We can thus determine the period of a given bulb by counting these antennas.
| |
| | |
| In an attempt to demonstrate that the thickness of the p/q-limb is zero, David Boll carried out a computer experiment in 1991, where he computed the number of iterations required for the series to converge for z = <math>\textstyle-\frac{3}{4} + i\epsilon</math> (<math>\textstyle-\frac{3}{4}</math> being the location thereof). As the series doesn't converge for the exact value of z = <math>\textstyle-\frac{3}{4}</math>, the number of iterations required increases with a small ε. It turns out that multiplying the value of ε with the number of iterations required yields an approximation of '''{{pi}}''' that becomes better the smaller ε. For example, for ε = 0.0000001 the number of iterations is 31415928 and the product is 3.1415928.<ref>Gary William Flake, ''The Computational Beauty of Nature'', 1998. p. 125. ISBN 978-0-262-56127-3</ref>
| |
| | |
| ===Image gallery of a zoom sequence===
| |
| The Mandelbrot set shows more intricate detail the closer one looks or [[magnification|magnifies]] the image, usually called "zooming in". The following example of an image sequence zooming to a selected ''c'' value gives an impression of the infinite richness of different geometrical structures, and explains some of their typical rules.
| |
| | |
| The magnification of the last image relative to the first one is about 10,000,000,000 to 1. Relating to an ordinary monitor, it represents a section of a Mandelbrot set with a diameter of 4 million kilometres. Its border would show an astronomical number of different fractal structures.
| |
| {{Clear}}
| |
| | |
| <gallery mode=packed>
| |
| Image:mandel zoom 00 mandelbrot set.jpg|Start. Mandelbrot set with continuously coloured environment.
| |
| Image:mandel zoom 01 head and shoulder.jpg|Gap between the "head" and the "body", also called the "seahorse valley"
| |
| Image:mandel zoom 02 seehorse valley.jpg|On the left double-spirals; on the right "seahorses"
| |
| Image:mandel zoom 03 seehorse.jpg|"Seahorse" upside down
| |
| </gallery>
| |
| | |
| The seahorse "body" is composed by 25 "spokes" consisting of two groups of 12 "spokes" each and one "spoke" connecting to the main cardioid. These two groups can be attributed by some kind of metamorphosis to the two "fingers" of the "upper hand" of the Mandelbrot set; therefore, the number of "spokes" increases from one "seahorse" to the next by 2; the "hub" is a so-called [[Misiurewicz point]]. Between the "upper part of the body" and the "tail" a distorted small copy of the Mandelbrot set called satellite may be recognized.
| |
| | |
| <gallery mode=packed>
| |
| Image:mandel zoom 04 seehorse tail.jpg|The central endpoint of the "seahorse tail" is also a Misiurewicz point.
| |
| Image:mandel zoom 05 tail part.jpg|Part of the "tail" — there is only one path consisting of the thin structures that lead through the whole "tail". This zigzag path passes the "hubs" of the large objects with 25 "spokes" at the inner and outer border of the "tail"; thus the Mandelbrot set is a [[Simply connected space|simply connected]] set, which means there are no islands and no loop roads around a hole.
| |
| Image:mandel zoom 06 double hook.jpg|Satellite. The two "seahorse tails" are the beginning of a series of concentric crowns with the satellite in the center. [http://guciek.github.com/web_mandelbrot.html#-0.743643;0.131825;0.00003;5000 Open this location in an interactive viewer.]
| |
| Image:mandel zoom 07 satellite.jpg|Each of these crowns consists of similar "seahorse tails"; their number increases with powers of 2, a typical phenomenon in the environment of satellites. The unique path to the spiral center passes the satellite from the groove of the cardioid to the top of the "antenna" on the "head".
| |
| Image:mandel zoom 08 satellite antenna.jpg|"Antenna" of the satellite. Several satellites of second order may be recognized.
| |
| Image:mandel zoom 09 satellite head and shoulder.jpg|The "seahorse valley" of the satellite. All the structures from the start of the zoom reappear.
| |
| Image:mandel zoom 10 satellite seehorse valley.jpg|Double-spirals and "seahorses" - unlike the 2nd image from the start they have appendices consisting of structures like "seahorse tails"; this demonstrates the typical linking of n+1 different structures in the environment of satellites of the order n, here for the simplest case n=1.
| |
| Image:mandel zoom 11 satellite double spiral.jpg|Double-spirals with satellites of second order - analog to the "seahorses" the double-spirals may be interpreted as a metamorphosis of the "antenna".
| |
| Image:mandel zoom 12 satellite spirally wheel with julia islands.jpg|In the outer part of the appendices islands of structures may be recognized; they have a shape like [[Julia set]]s ''J<sub>c</sub>''; the largest of them may be found in the center of the "double-hook" on the right side.
| |
| Image:mandel zoom 13 satellite seehorse tail with julia island.jpg|Part of the "double-hook"
| |
| Image:mandel zoom 14 satellite julia island.jpg|Islands; see below
| |
| </gallery>
| |
| | |
| The islands above seem to consist of infinitely many parts like [[Cantor set]]s, as is{{Clarify|date=May 2010}} actually the case for the corresponding Julia set ''J<sub>c</sub>''. However they are connected by tiny structures so that the whole represents a simply connected set. The tiny structures meet each other at a satellite in the center that is too small to be recognized at this magnification. The value of ''c'' for the corresponding ''J<sub>c</sub>'' is not that of the image center but, relative to the main body of the Mandelbrot set, has the same position as the center of this image relative to the satellite shown in the 6th zoom step.
| |
| | |
| ==Generalizations==
| |
| [[Multibrot set]]s are bounded sets found in the complex plane for members of the general monic univariate [[polynomial]] family of recursions
| |
| | |
| :<math> z \mapsto z^d + c.\ </math>
| |
| | |
| For integer d, these sets are connectedness loci for the Julia sets built from the same formula. The full [[cubic connectedness map]] has also been studied; here one considers the two-parameter recursion <math> z \mapsto z^3 + 3kz + c </math>, whose two [[critical point (mathematics)|critical points]] are the [[complex square root]]s of the parameter ''k''. A point is in the map if either critical point is stable.<ref>[[Rudy Rucker]]'s discussion of the CCM: [http://www.cs.sjsu.edu/faculty/rucker/cubic_mandel.htm CS.sjsu.edu]</ref>
| |
| | |
| For general families of holomorphic functions, the ''boundary'' of the Mandelbrot set generalizes to the [[bifurcation locus]], which is a natural object to study even when the connectedness locus is not useful.
| |
| | |
| ==Other non-analytic mappings==
| |
| Of particular interest is the
| |
| [[tricorn (mathematics)|tricorn]] fractal, the connectedness locus of the anti-holomorphic family
| |
| | |
| :<math> z \mapsto \bar{z}^2 + c\, .</math>
| |
| | |
| The tricorn (also sometimes called the ''Mandelbar set'') was encountered by [[John Milnor|Milnor]] in his study of parameter slices of real cubic polynomials. It is ''not'' locally connected. This property is inherited by the connectedness locus of real cubic polynomials.
| |
| | |
| Another non-analytic generalization is the [[Burning Ship fractal]], which is obtained by iterating the mapping
| |
| | |
| :<math> z \mapsto (|\Re \left(z\right)|+i|\Im \left(z\right)|)^2 + c\, .</math>
| |
| | |
| The [[Multibrot set]] is obtained by varying the value of the exponent ''d''. The [[Multibrot set|article]] has a video that shows the development from ''d'' = 0 to 7 at which point there are 6 i.e. (''d'' - 1) lobes around the perimeter. A similar development with negative exponents results in (1 - ''d'') clefts on the inside of a ring.
| |
| | |
| ==Computer drawings==
| |
| [[Image:Fractal-zoom-1-03-Mandelbrot Buzzsaw.png|right|thumbnail|Still image of [[media:Fractal-zoom-1-03-Mandelbrot Buzzsaw.ogg|a movie of increasing magnification]] on 0.001643721971153 - 0.822467633298876i]]
| |
| There are many programs used to generate the Mandelbrot set and other fractals, some of which are described in [[fractal-generating software]]. These programs use a variety of algorithms to determine the color of individual pixels and achieve efficient computation.
| |
| | |
| ===Escape time algorithm===
| |
| The simplest algorithm for generating a representation of the Mandelbrot set is known as the "escape time" algorithm. A repeating calculation is performed for each ''x'', ''y'' point in the plot area and based on the behavior of that calculation, a color is chosen for that pixel.
| |
| | |
| The ''x'' and ''y'' locations of each point are used as starting values in a repeating, or iterating calculation (described in detail below). The result of each iteration is used as the starting values for the next. The values are checked during each iteration to see if they have reached a critical 'escape' condition or 'bailout'. If that condition is reached, the calculation is stopped, the pixel is drawn, and the next x, y point is examined. For some starting values, escape occurs quickly, after only a small number of iterations. For starting values very close to but not in the set, it may take hundreds or thousands of iterations to escape. For values within the Mandelbrot set, escape will never occur. The programmer or user must choose how much iteration, or 'depth,' they wish to examine. The higher the maximum number of iterations, the more detail and subtlety emerge in the final image, but the longer time it will take to calculate the fractal image.
| |
| | |
| Escape conditions can be simple or complex. Because no complex number with a real or imaginary part greater than 2 can be part of the set, a common bailout is to escape when either coefficient exceeds 2. A more computationally complex method that detects escapes sooner, is to compute distance from the origin using the [[Pythagorean theorem]], i.e., to determine the [[absolute value]], or ''modulus'', of the complex number. If this value exceeds two, the point has reached escape. More computationally intensive rendering variations include the [[Buddhabrot]] method, which finds escaping points and plots their iterated coordinates.
| |
| | |
| The color of each point represents how quickly the values reached the escape point. Often black is used to show values that fail to escape before the iteration limit, and gradually brighter colours are used for points that escape. This gives a visual representation of how many cycles were required before reaching the escape condition.
| |
| | |
| To render such an image, the region of the complex plane we are considering is subdivided into a certain number of [[pixel]]s. To color any such pixel, let <math>c</math> be the midpoint of that pixel. We now iterate the critical point 0 under <math>P_c</math>, checking at each step whether the orbit point has modulus larger than 2. When this is the case, we know that <math>c</math> does not belong to the Mandelbrot set, and we color our pixel according to the number of iterations used to find out. Otherwise, we keep iterating up to a fixed number of steps, after which we decide that our parameter is "probably" in the Mandelbrot set, or at least very close to it, and color the pixel black.
| |
| | |
| In [[pseudocode]], this algorithm would look as follows. The algorithm does not use complex numbers, and manually simulates complex number operations using two real numbers, for those who do not have a [[complex data type]]. The program may be simplified if the programming language includes complex data type operations.
| |
| | |
| <!-- NOTE that xtemp is necessary otherwise y would be calculated with the new x, which would be wrong. Also note that one must plot (''x''<sub>0</sub>, ''y''<sub>0</sub>), not (''x'',''y''). -->
| |
| <pre>For each pixel (Px, Py) on the screen, do:
| |
| {
| |
| x0 = scaled x coordinate of pixel (scaled to lie in the Mandelbrot X scale (-2.5, 1))
| |
| y0 = scaled y coordinate of pixel (scaled to lie in the Mandelbrot Y scale (-1, 1))
| |
| x = 0.0
| |
| y = 0.0
| |
| iteration = 0
| |
| max_iteration = 1000
| |
| while ( x*x + y*y < 2*2 AND iteration < max_iteration )
| |
| {
| |
| xtemp = x*x - y*y + x0
| |
| y = 2*x*y + y0
| |
| x = xtemp
| |
| iteration = iteration + 1
| |
| }
| |
| color = palette[iteration]
| |
| plot(Px, Py, color)
| |
| }
| |
| </pre>
| |
| where, relating the pseudocode to <math>c</math>, <math>z</math> and <math>P_c</math>:
| |
| * <math>z = x + iy\ </math>
| |
| * <math>z^2 = x^2 +i2xy - y^2\ </math>
| |
| * <math>c = x_0 + i y_0\ </math>
| |
| and so, as can be seen in the pseudocode in the computation of ''x'' and ''y'':
| |
| * <math>x = \mathop{\mathrm{Re}}(z^2+c) = x^2-y^2 + x_0</math> and <math>y = \mathop{\mathrm{Im}}(z^2+c) = 2xy + y_0.\ </math>
| |
| | |
| To get colorful images of the set, the assignment of a color to each value of the number of executed iterations can be made using one of a variety of functions (linear, exponential, etc.). One practical way, without slowing down calculations, is to use the number of executed iterations as an entry to a look-up color palette table initialized at startup. If the color table has, for instance, 500 entries, then the color selection is ''n'' mod 500, where ''n'' is the number of iterations.
| |
| | |
| ====Histogram coloring====
| |
| A more accurate coloring method involves using a [[histogram]], which keeps track of how many pixels reached each iteration number, from 1 to n. This method will equally distribute colors to the same overall area, and, importantly, is independent of the maximum number of iterations chosen.
| |
| | |
| First, create an array of size n. For each pixel, which took i iterations, find the ith element and increment it. This creates the histogram during computation of the image. Then, when finished, perform a second "rendering" pass over each pixel, utilizing the completed histogram. If you had a continuous color palette ranging from [0.0, 1.0], you could find the normalized color of each pixel as follows, using the variables from above.
| |
| <pre>
| |
| total = 0
| |
| for (i = 0; i < max_iterations; i += 1)
| |
| {
| |
| total += histogram[i]
| |
| }
| |
| | |
| hue = 0.0;
| |
| for (i = 0; i < iteration; i += 1)
| |
| {
| |
| hue += histogram[i] / total // Must be floating-point division.
| |
| }
| |
| | |
| color = palette[hue]
| |
| </pre>
| |
| | |
| This method may be combined with the smooth coloring method below for more aesthetically pleasing images.
| |
| | |
| ====Continuous (smooth) coloring====
| |
| {{multiple image| direction = vertical
| |
| | width = 180
| |
| | image1 = Escape Time Algorithm.png
| |
| | caption1 = This image was rendered with the Escape Time Algorithm. Notice the very obvious "bands" of color.
| |
| | image2 = Normalized Iteration Count Algorithm.png
| |
| | caption2 = This image was rendered with the Normalized Iteration Count Algorithm. Notice the bands of color have been replaced by a smooth gradient. Also, the colors take on the same pattern that would be observed if the Escape Time Algorithm were used.
| |
| }}
| |
| | |
| The Escape Time Algorithm is popular for its simplicity. However, it creates bands of color, which, as a type of [[aliasing]], can detract from an image's aesthetic value. This can be improved using an algorithm known as "Normalized Iteration Count",<ref>{{cite journal|last=García|first=Francisco|coauthors=Ángel Fernández, Javier Barrallo, Luis Martín|title=Coloring Dynamical Systems in the Complex Plane|url=http://math.unipa.it/~grim/Jbarrallo.PDF|format=PDF|accessdate=2008-01-21}}</ref><ref>{{cite web|url=http://linas.org/art-gallery/escape/escape.html|title=Renormalizing the Mandelbrot Escape|author=Linas Vepstas}}</ref> which provides a smooth transition of colors between iterations. The algorithm associates a real number <math>\nu</math> with each value of ''z'' by using the connection of the iteration number with the [[Julia set|potential function]]. This function is given by
| |
| | |
| : <math>\phi(z) = \lim_{n \to \infty} (\log|z_n|/P^{n}),\,</math>
| |
| | |
| where ''z''<sub>''n''</sub> is the value after ''n'' iterations and ''P'' is the power for which ''z'' is raised to in the Mandelbrot set equation (''z''<sub>''n''+1</sub> = ''z<sub>''n''</sub>''<sup>''P''</sup> + ''c'', ''P'' is generally 2).
| |
| | |
| If we choose a large bailout radius ''N'' (e.g., 10<sup>100</sup>), we have that
| |
| | |
| : <math>\log|z_n|/P^{n} = \log(N)/P^{\nu(z)},\,</math>
| |
| | |
| for some real number <math>\nu(z)</math>, and this is
| |
| | |
| : <math>\nu(z) = n - \log_P (\log|z_n|/\log(N)),\,</math>
| |
| | |
| and as ''n'' is the first iteration number such that |''z''<sub>''n''</sub>| > ''N'', the number we subtract from ''n'' is in the interval <nowiki>[0, 1)</nowiki>.
| |
| | |
| For the colouring we must have a cyclic scale of colours (constructed mathematically, for instance) and containing ''H'' colours numbered from 0 to ''H'' − 1 (''H'' = 500, for instance). We multiply the real number <math>\nu(z)</math> by a fixed real number determining the density of the colours in the picture, and take the integral part of this number modulo ''H'', and use it to look up the corresponding color in the color table.
| |
| | |
| For example, modifying the above pseudocode would yield
| |
| <pre>For each pixel (Px, Py) on the screen, do:
| |
| {
| |
| x0 = scaled x coordinate of pixel (scaled to lie in the Mandelbrot X scale (-2.5, 1))
| |
| y0 = scaled y coordinate of pixel (scaled to lie in the Mandelbrot Y scale (-1, 1))
| |
| x = 0.0
| |
| y = 0.0
| |
| iteration = 0
| |
| max_iteration = 1000
| |
| // Here 2^16 is chosen as a reasonable bailout radius.
| |
| while ( x*x + y*y < (2 << 16) AND iteration < max_iteration ) {
| |
| xtemp = x*x - y*y + x0
| |
| y = 2*x*y + y0
| |
| x = xtemp
| |
| iteration = iteration + 1
| |
| }
| |
| // Used to avoid floating point issues with points inside the set.
| |
| if ( iteration < max_iteration ) {
| |
| zn = sqrt( x*x + y*y )
| |
| nu = log( log(zn) / log(2) ) / log(2)
| |
| // Rearranging the potential function.
| |
| // Could remove the sqrt and multiply log(zn) by 1/2, but less clear.
| |
| // Dividing log(zn) by log(2) instead of log(N = 2<<16)
| |
| // because we want the entire palette to range from the
| |
| // center to radius 2, NOT our bailout radius.
| |
| iteration = iteration + 1 - nu
| |
| }
| |
| color1 = palette[floor(iteration)]
| |
| color2 = palette[floor(iteration) + 1]
| |
| // iteration % 1 = fractional part of iteration.
| |
| color = linear_interpolate(color1, color2, iteration % 1)
| |
| plot(Px, Py, color)
| |
| }
| |
| </pre>
| |
| | |
| ===Distance estimates===
| |
| One can compute the [[distance]] from point ''c'' (in [[exterior (topology)|exterior]] or [[interior (topology)|interior]]) to nearest point on the [[boundary (topology)|boundary]] of Mandelbrot set.<ref>{{cite web | url=http://www.moleculardensity.net/buddhabrot/appendix/2 | title=Interior and exterior distance bounds for the Mandelbrot | author=Albert Lobo Cusidó}}</ref>
| |
| | |
| ====Exterior distance estimation====
| |
| The proof of the [[Mandelbrot set#Basic properties|connectedness]] of the Mandelbrot set in fact gives a formula for the [[Uniform isomorphism|uniformizing map]] of the [[complement (set theory)|complement]] of <math>M</math> (and the [[derivative]] of this map). By the [[Koebe 1/4 theorem]], one can then estimate the distance between the midpoint of our [[pixel]] and the Mandelbrot set up to a factor of 4.
| |
| | |
| In other words, provided that the maximal number of iterations is sufficiently high, one obtains a picture of the Mandelbrot set with the following properties:
| |
| <ol>
| |
| <li> Every pixel that contains a point of the Mandelbrot set is colored black.
| |
| <li> Every pixel that is colored black is close to the Mandelbrot set.
| |
| </ol>
| |
| | |
| [[Image:Demm 2000 Mandelbrot set.jpg|thumb|Exterior distance estimate may be used to color whole complement of Mandelbrot set]]
| |
| The distance estimate ''b'' of a pixel ''c'' (a complex number) from the Mandelbrot set is given by
| |
| | |
| : <math>b=\lim_{n \to \infty} 2\cdot\frac{\mid{P_c^n(c)\mid\cdot\ln\mid{P_c^n(c)}}\mid}{\mid\frac{\partial}{\partial{c}} P_c^n(c)\mid}</math>
| |
| where <ul>
| |
| <li><math>P_c(z) \,</math> stands for [[complex quadratic polynomial]]</li>
| |
| <li><math>P_c^n(c)</math> stands for ''n'' iterations of <math>P_c(z) \to z</math> or <math>z^2 + c \to z</math>, starting with <math>z=c</math>:
| |
| <math>P_c^{ 0}(c) = c</math>,
| |
| <math>P_c^{ n+1}(c) = P_c^n(c)^2 + c</math>;</li>
| |
| <li><math>\frac{\partial}{\partial{c}} P_c^n(c)</math> is the
| |
| derivative of <math>P_c^n(c)</math> with respect to c. This derivative
| |
| can be found by starting with <math>\frac{\partial}{\partial{c}} P_c^{ 0}(c) = 1</math>
| |
| and then <math>\frac{\partial}{\partial{c}} P_c^{ n+1}(c) = 2\cdot{}P_c^n(c)\cdot\frac{\partial}{\partial{c}} P_c^n(c) + 1</math>. This can easily be verified by using the chain rule for the derivative.</ul>
| |
| | |
| The idea behind this formula is simple: When the equipotential lines for the potential function <math>\phi(z)</math> lie close, the number <math>|\phi'(z)|</math> is large, and conversely, therefore the equipotential lines for the function <math>\phi(z)/|\phi'(z)|</math> should lie approximately regularly.
| |
| | |
| From a mathematician's point of view, this formula only works in limit where ''n'' goes to infinity, but very reasonable estimates can be found with just a few additional iterations after the main loop exits.
| |
| | |
| Once ''b'' is found, by [[Koebe quarter theorem|the Koebe 1/4-theorem]], we know there's no point of the Mandelbrot set with distance from ''c'' smaller than <em>b/4<em>.
| |
| | |
| The distance estimation can be used for drawing of the boundary of the Mandelbrot set, see the article [[Julia set]].
| |
| | |
| ====Interior distance estimation====
| |
| [[Image:Mandelbrot Interior 600.png|thumb|Pixels colored according to the estimated interior distance]]
| |
| It is also possible to estimate the distance of a limitly periodic (i.e., inner) point to the boundary of the Mandelbrot set. The estimate is given by
| |
| | |
| : <math>b=\frac{1-\mid{\frac{\partial}{\partial{z}}P_c^p(z_0)}\mid^2}
| |
| {\mid{\frac{\partial}{\partial{c}}\frac{\partial}{\partial{z}}P_c^p(z_0) +
| |
| \frac{\partial}{\partial{z}}\frac{\partial}{\partial{z}}P_c^p(z_0)
| |
| \frac{\frac{\partial}{\partial{c}}P_c^p(z_0)}
| |
| {1-\frac{\partial}{\partial{z}}P_c^p(z_0)}}\mid}</math>
| |
| where<ul>
| |
| <li><math>p</math> is the period,</li>
| |
| <li><math>c</math> is the point to be estimated,</li>
| |
| <li><math>P_c(z)</math> is the [[complex quadratic polynomial]] <math>P_c(z)=z^2 + c</math>
| |
| <li><math>P_c^p(z_0)</math> is the <math>p</math>-fold iteration of <math>P_c(z) \to z</math>, starting with <math>P_c^{ 0}(z) = z_0</math></li>
| |
| <li><math>z_0</math> is any of the <math>p</math> points that make the [[attractor]] of the iterations of <math>P_c(z) \to z</math> starting with <math>P_c^{ 0}(z) = c</math>; <math>z_0</math> satisfies <math>z_0 = P_c^p(z_0)</math>,</li>
| |
| <li><math>\frac{\partial}{\partial{c}}\frac{\partial}{\partial{z}}P_c^p(z_0)</math>,
| |
| <math>\frac{\partial}{\partial{z}}\frac{\partial}{\partial{z}}P_c^p(z_0)</math>,
| |
| <math>\frac{\partial}{\partial{c}}P_c^p(z_0)</math> and
| |
| <math>\frac{\partial}{\partial{z}}P_c^p(z_0)</math> are various derivatives of
| |
| <math>P_c^p(z)</math>, evaluated at <math>z_0</math>.</li></ul>
| |
| | |
| Analogous to the exterior case, once ''b'' is found, we know that all points within the distance of ''b''/4 from ''c'' are inside the Mandelbrot set.
| |
| | |
| There are two practical problems with the interior distance estimate: first, we need to find <math>z_0</math> precisely, and second, we need to find <math>p</math> precisely.
| |
| The problem with <math>z_0</math> is that the convergence to <math>z_0</math> by iterating <math>P_c(z)</math> requires, theoretically, an infinite number of operations.
| |
| The problem with period is that, sometimes, due to rounding errors, a period is falsely identified to be an integer multiple of the real period (e.g., a period of 86 is detected, while the real period is only 43=86/2). In such case, the distance is overestimated, i.e., the reported radius could contain points outside the Mandelbrot set.
| |
| [[Image:MandelbrotOrbitInfimum.png|thumb|3D view : smallest absolute value of the orbit of the interior points of the Mandelbrot set]]
| |
| | |
| ===Optimizations===
| |
| | |
| ====Cardioid / bulb checking====
| |
| One way to improve calculations is to find out beforehand whether the given point lies within the cardioid or in the period-2 bulb. Before passing the complex value through the escape time algorithm, first check if:
| |
| | |
| :<math> p = \sqrt{ \left(x - \frac{1}{4}\right)^2 + y^2} </math>
| |
| :<math> x < p - 2p^2 + \frac{1}{4} </math>
| |
| :<math> (x+1)^2 + y^2 < \frac{1}{16} </math>
| |
| | |
| where x represents the real value of the point and y the imaginary value. The first two equations determine if the point is within the cardioid, the last the period-2 bulb.
| |
| | |
| The cardioid test can equivalently be performed without the square root:
| |
| | |
| :<math> q = \left(x - \frac{1}{4}\right)^2 + y^2 </math>
| |
| :<math> q \left(q + \left(x - \frac{1}{4}\right)\right) < \frac{1}{4}y^2. </math>
| |
| | |
| 3rd- and higher-order buds do not have equivalent tests, because they are not perfectly circular.<ref>
| |
| {{cite web
| |
| |url=http://linas.org/art-gallery/bud/bud.html
| |
| |title=Mandelbrot Bud Maths}}</ref> However, it is possible to find whether the points are within circles that are circumscribed by these higher order bulbs, preventing many, though not all, of the points in the bulb from being iterated.
| |
| | |
| ====Periodicity checking====
| |
| To prevent having to do huge numbers of iterations for points in the set, one can perform periodicity checking. Check if a point reached in iterating a pixel has been reached before. If so, the pixel cannot diverge and must be in the set.
| |
| | |
| Periodicity checking is, of course, a trade-off. The need to remember points costs memory and ''data management'' instructions, whereas it saves ''computational'' instructions.
| |
| | |
| However, checking against only one previous iteration can detect many periods with little performance overhead. For example, within the while loop of the pseudocode above, make the following modifications.
| |
| <pre>
| |
| while ( x*x + y*y < 2*2 AND iteration < max_iteration )
| |
| {
| |
| xtemp = x*x - y*y + x0
| |
| ytemp = 2*x*y + y0
| |
| if (x == xtemp AND y == ytemp)
| |
| {
| |
| iteration = max_iteration
| |
| break
| |
| }
| |
| x = xtemp
| |
| y = ytemp
| |
| iteration = iteration + 1
| |
| }
| |
| </pre>
| |
| | |
| ====Border tracing / edge checking====
| |
| It can be shown that if a solid shape can be drawn on the Mandelbrot set, with all the border colors being the same, then the shape can be filled in with that color. This is a result of the Mandelbrot set being simply connected. Boundary tracing works by following the edges of the various iteration levels (colored bands) all around, then filling the shape in. This can be a good speed increase, because it means that large numbers of points can be skipped.<ref>{{cite web|url=http://www.reocities.com/CapeCanaveral/5003/mandel.htm|title=Boundary Tracing Method}}</ref>
| |
| | |
| A similar method operation on the same principle uses rectangles instead of arbitrary border shapes. It is usually faster than boundary tracing because it requires fewer calculations to work out the rectangle. It is inefficient however because boundaries are not rectangular, and so some areas get missed out. This issue can be minimized by created a recursive algorithm that, if a rectangle border fails, will subdivide it into four smaller rectangles and test those, and either fill each or subdivide again and repeat the process.
| |
| | |
| However, this only works using discrete colors in the escape time algorithm. It will not work for smooth/continuous coloring.
| |
| | |
| ==Popular culture==
| |
| * The [[Jonathan Coulton]] song, "Mandelbrot Set", is a tribute to both the fractal itself, and to its father Benoit Mandelbrot.
| |
| * The second book of the [[Mode series]] by [[Piers Anthony]], Fractal Mode, describes a world that is a perfect 3d model of the set.
| |
| * The Mandelbrot set is found on the wings of the fictional Quantum Weather Butterfly in [[Terry Pratchett]]'s Discworld series.
| |
| * The [[Arthur C. Clarke]] novel ''[[The Ghost from the Grand Banks]]'' features an artificial lake made to replicate the shape of the Mandelbrot set.
| |
| * [[The Big Bang Theory]] Season One, Episode Two [[Sheldon Cooper]] remarks in reference to [[Penny (The Big Bang Theory)|Penny's]] room "A little messy? The Mandelbrot set of complex numbers is a little messy. This is chaos!" (6:33-6:38)
| |
| | |
| ==See also==
| |
| * [[Buddhabrot]]
| |
| * [[Burning Ship fractal]]
| |
| * [[Collatz fractal]]
| |
| * [[Gilbreath permutation]], a combinatorial object that can be used to count the real periodic points of the Mandelbrot set
| |
| * [[Tricorn (mathematics)|Mandelbar set]]
| |
| * [[Mandelbox]]
| |
| * [[Mandelbulb]]
| |
| * [[Multibrot set]]
| |
| * [[Newton fractal]]
| |
| * [[Orbit portrait]]
| |
| * [[Orbit trap]]
| |
| * [[Pickover stalk]]
| |
| | |
| ==References==
| |
| {{Reflist|2}}
| |
| | |
| ==Further reading==
| |
| * [[John W. Milnor]], ''Dynamics in One Complex Variable'' (Third Edition), Annals of Mathematics Studies 160, (Princeton University Press, 2006), ISBN 0-691-12488-4 <br />(First appeared in 1990 as a [http://www.math.sunysb.edu/preprints.html Stony Brook IMS Preprint], available as [http://www.arxiv.org/abs/math.DS/9201272 arXiV:math.DS/9201272] )
| |
| * Nigel Lesmoir-Gordon, ''The Colours of Infinity: The Beauty, The Power and the Sense of Fractals'', ISBN 1-904555-05-5 <br />(includes a DVD featuring [[Arthur C. Clarke]] and [[David Gilmour]])
| |
| * [[Heinz-Otto Peitgen]], [[Hartmut Jürgens]], [[Dietmar Saupe]], ''Chaos and Fractals - New Frontiers of Science'' (Springer, New-York, 1992, 2004), ISBN 0-387-20229-3
| |
| | |
| ==External links==
| |
| {{Wikibooks|Fractals }}
| |
| {{commons}}
| |
| <!--===========================({{NoMoreLinks}})===============================-->
| |
| <!--| DO NOT ADD MORE LINKS TO THIS ARTICLE. WIKIPEDIA IS NOT A COLLECTION OF |-->
| |
| <!--| LINKS. If you think that your link might be useful, do not add it here, |-->
| |
| <!--| but put it on this article's discussion page first or submit your link |-->
| |
| <!--| to the appropriate category at the Open Directory Project (www.dmoz.org)|-->
| |
| <!--| and link back to that category using the {{dmoz}} template. |-->
| |
| <!--| |-->
| |
| <!--| Links that have not been verified WILL BE DELETED. |-->
| |
| <!--| See [[Wikipedia:External links]] and [[Wikipedia:Spam]] for details |-->
| |
| <!--===========================({{NoMoreLinks}})===============================-->
| |
| * {{dmoz|Science/Math/Chaos_and_Fractals|Chaos and Fractals}}
| |
| * [http://classes.yale.edu/Fractals/MandelSet/welcome.html The Mandelbrot Set and Julia Sets by Michael Frame, Benoit Mandelbrot, and Nial Neger]
| |
| * [http://vimeo.com/12185093 Video: Mandelbrot fractal zoom to 6.066 e228]
| |
| * [http://www-personal.umich.edu/~bethchen/mandalabeth/ मण्डलबेथ (maṇḍalabeth)] 3D analog of the mandelbrot set, with various symmetry groups
| |
| | |
| {{Fractals}}
| |
| | |
| {{DEFAULTSORT:Mandelbrot Set}}
| |
| [[Category:Fractals]]
| |
| [[Category:Articles containing video clips]]
| |
| [[Category:Articles with example pseudocode]]
| |
| [[Category:Complex dynamics]]
| |
| | |
| {{Link GA|de}}
| |
| {{Link GA|lv}}
| |