Evaluating number of iteration with a certain map with While Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Why should I avoid the For loop in Mathematica?Out of memory in a Do loopRepeating Calculations/Iterations without a specific functionWhile loop with changing variable , NDSolve and an IntegralUsing Map function with NDSolveHow do I repeat the number of times a nested for loop does an iteration?

If a contract sometimes uses the wrong name, is it still valid?

Why is my conclusion inconsistent with the van't Hoff equation?

What's the purpose of writing one's academic biography in the third person?

Is there a node or combination of nodes that can take an average colour out of a single image?

Dating a Former Employee

illegal generic type for instanceof when using local classes

What would be the ideal power source for a cybernetic eye?

Using Random Forest variable importance for feature selection

Is the Standard Deduction better than Itemized when both are the same amount?

Storing hydrofluoric acid before the invention of plastics

How does the particle を relate to the verb 行く in the structure「A を + B に行く」?

How do I stop a creek from eroding my steep embankment?

Why did the rest of the Eastern Bloc not invade Yugoslavia?

Seeking colloquialism for “just because”

porting install scripts : can rpm replace apt?

What is Arya's weapon design?

Coloring maths inside a tcolorbox

Book where humans were engineered with genes from animal species to survive hostile planets

Apollo command module space walk?

What exactly is a "Meth" in Altered Carbon?

Echoing a tail command produces unexpected output?

Is it ethical to give a final exam after the professor has quit before teaching the remaining chapters of the course?

Output the ŋarâþ crîþ alphabet song without using (m)any letters

What does the word "veer" mean here?



Evaluating number of iteration with a certain map with While



Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Why should I avoid the For loop in Mathematica?Out of memory in a Do loopRepeating Calculations/Iterations without a specific functionWhile loop with changing variable , NDSolve and an IntegralUsing Map function with NDSolveHow do I repeat the number of times a nested for loop does an iteration?










2












$begingroup$


Beeing used to programming in C-like languages I am struggling with iterations and loops with mathematica. I am trying not to use the For command, as already lots of people recommended.



I am trying to solve the following problem:



Given the map $z_i+1= z_i^2 +c$ with $z_i, c in mathbbC$ and $z_0 = 0$ evaluate the contours that represents given the parameter $c$ the number of iterations $i$ that I have to perform in order to have $|z_i|> 2$. Perform the computation with $-0.6 leq Re(z_i)leq -0.4 $ and $0.6 leq Im(z_i)leq 0.4$ and 100 points per axis.



Given the condition I though I could use a While Loop to perform the task



i=0; (*init counter*)
z[i]=0; (*init z[i]*)
g[c_]:= While[
Abs[z[i]]<= 2, (*condition*)
z[i+1]= z[i]^2 +c; (*process*)
i++; (*increment*)
]
Print[i]
g[0.2 + 0.2 I]


This computation with the input, say, $(-0.2 +0.2 i)$ (and with many others) takes all the memory of the machine I am using (Wolfram online). I don't understand whether I am just missing something or the amount of computation I can perform on the server just isn't enough (which seems really unlikely)



Furthermore I would like the function to return an integer (i - the number of iterations) but I really struggle with how to correctly use the synthax of Mathematica to do that.



Thanks in advance to everyone who is so keen to stop by and help :)










share|improve this question









$endgroup$











  • $begingroup$
    Hello there. Just wanted to point out that for the input you give as example the computation will never finish because the condition is always satisfied. The absolute value never goes above 0.36.
    $endgroup$
    – Kiro
    Apr 10 at 8:20















2












$begingroup$


Beeing used to programming in C-like languages I am struggling with iterations and loops with mathematica. I am trying not to use the For command, as already lots of people recommended.



I am trying to solve the following problem:



Given the map $z_i+1= z_i^2 +c$ with $z_i, c in mathbbC$ and $z_0 = 0$ evaluate the contours that represents given the parameter $c$ the number of iterations $i$ that I have to perform in order to have $|z_i|> 2$. Perform the computation with $-0.6 leq Re(z_i)leq -0.4 $ and $0.6 leq Im(z_i)leq 0.4$ and 100 points per axis.



Given the condition I though I could use a While Loop to perform the task



i=0; (*init counter*)
z[i]=0; (*init z[i]*)
g[c_]:= While[
Abs[z[i]]<= 2, (*condition*)
z[i+1]= z[i]^2 +c; (*process*)
i++; (*increment*)
]
Print[i]
g[0.2 + 0.2 I]


This computation with the input, say, $(-0.2 +0.2 i)$ (and with many others) takes all the memory of the machine I am using (Wolfram online). I don't understand whether I am just missing something or the amount of computation I can perform on the server just isn't enough (which seems really unlikely)



Furthermore I would like the function to return an integer (i - the number of iterations) but I really struggle with how to correctly use the synthax of Mathematica to do that.



Thanks in advance to everyone who is so keen to stop by and help :)










share|improve this question









$endgroup$











  • $begingroup$
    Hello there. Just wanted to point out that for the input you give as example the computation will never finish because the condition is always satisfied. The absolute value never goes above 0.36.
    $endgroup$
    – Kiro
    Apr 10 at 8:20













2












2








2





$begingroup$


Beeing used to programming in C-like languages I am struggling with iterations and loops with mathematica. I am trying not to use the For command, as already lots of people recommended.



I am trying to solve the following problem:



Given the map $z_i+1= z_i^2 +c$ with $z_i, c in mathbbC$ and $z_0 = 0$ evaluate the contours that represents given the parameter $c$ the number of iterations $i$ that I have to perform in order to have $|z_i|> 2$. Perform the computation with $-0.6 leq Re(z_i)leq -0.4 $ and $0.6 leq Im(z_i)leq 0.4$ and 100 points per axis.



Given the condition I though I could use a While Loop to perform the task



i=0; (*init counter*)
z[i]=0; (*init z[i]*)
g[c_]:= While[
Abs[z[i]]<= 2, (*condition*)
z[i+1]= z[i]^2 +c; (*process*)
i++; (*increment*)
]
Print[i]
g[0.2 + 0.2 I]


This computation with the input, say, $(-0.2 +0.2 i)$ (and with many others) takes all the memory of the machine I am using (Wolfram online). I don't understand whether I am just missing something or the amount of computation I can perform on the server just isn't enough (which seems really unlikely)



Furthermore I would like the function to return an integer (i - the number of iterations) but I really struggle with how to correctly use the synthax of Mathematica to do that.



Thanks in advance to everyone who is so keen to stop by and help :)










share|improve this question









$endgroup$




Beeing used to programming in C-like languages I am struggling with iterations and loops with mathematica. I am trying not to use the For command, as already lots of people recommended.



I am trying to solve the following problem:



Given the map $z_i+1= z_i^2 +c$ with $z_i, c in mathbbC$ and $z_0 = 0$ evaluate the contours that represents given the parameter $c$ the number of iterations $i$ that I have to perform in order to have $|z_i|> 2$. Perform the computation with $-0.6 leq Re(z_i)leq -0.4 $ and $0.6 leq Im(z_i)leq 0.4$ and 100 points per axis.



Given the condition I though I could use a While Loop to perform the task



i=0; (*init counter*)
z[i]=0; (*init z[i]*)
g[c_]:= While[
Abs[z[i]]<= 2, (*condition*)
z[i+1]= z[i]^2 +c; (*process*)
i++; (*increment*)
]
Print[i]
g[0.2 + 0.2 I]


This computation with the input, say, $(-0.2 +0.2 i)$ (and with many others) takes all the memory of the machine I am using (Wolfram online). I don't understand whether I am just missing something or the amount of computation I can perform on the server just isn't enough (which seems really unlikely)



Furthermore I would like the function to return an integer (i - the number of iterations) but I really struggle with how to correctly use the synthax of Mathematica to do that.



Thanks in advance to everyone who is so keen to stop by and help :)







procedural-programming






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked Apr 9 at 14:27









JacquesLeenJacquesLeen

304




304











  • $begingroup$
    Hello there. Just wanted to point out that for the input you give as example the computation will never finish because the condition is always satisfied. The absolute value never goes above 0.36.
    $endgroup$
    – Kiro
    Apr 10 at 8:20
















  • $begingroup$
    Hello there. Just wanted to point out that for the input you give as example the computation will never finish because the condition is always satisfied. The absolute value never goes above 0.36.
    $endgroup$
    – Kiro
    Apr 10 at 8:20















$begingroup$
Hello there. Just wanted to point out that for the input you give as example the computation will never finish because the condition is always satisfied. The absolute value never goes above 0.36.
$endgroup$
– Kiro
Apr 10 at 8:20




$begingroup$
Hello there. Just wanted to point out that for the input you give as example the computation will never finish because the condition is always satisfied. The absolute value never goes above 0.36.
$endgroup$
– Kiro
Apr 10 at 8:20










3 Answers
3






active

oldest

votes


















7












$begingroup$

The problem with your code is that for some values of c, Abs[z] will never become larger than 2. You need to cap the number of iterations.




For this type of iteration, the typical function to use is Nest and related functions.



countIter[c_] := 
Length@NestWhileList[
#^2 + c &,
0.0,
Abs[#] <= 2 &,
1,
100 (* limit number of iterations to 100 *)
]

result =
Table[
countIter[re + im I],
re, -0.6, -0.4, 0.2/100,
im, 0.4, 0.6, 0.2/100
];

ArrayPlot[result, ColorFunction -> "Rainbow"]


enter image description here




However, this type of problem is quite amenable to compilation with Compile. When using Compile, the usual advice does not apply: a procedural style is still the best. (This does not mean that For is good, I'd still argue against that. But there are many other procedural constructs such as Do and While).



countIterCompiled = Compile[c, _Complex,
Block[z = 0.0 + 0.0 I, i = 0,
While[i <= 100 && Abs[z] <= 2,
z = z^2 + c;
i++
];
i
]
]


Using countIterCompiled will be much faster than countIter.






share|improve this answer











$endgroup$












  • $begingroup$
    thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
    $endgroup$
    – JacquesLeen
    Apr 9 at 15:33










  • $begingroup$
    @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
    $endgroup$
    – Szabolcs
    Apr 9 at 15:59


















3












$begingroup$

For iterated function systems like this, Nest and relatives are the preferred tools. Just exploring your (rather famous) map:



f[z_, c_] := z^2 + c
Abs[NestList[f[#, 0.2 + 0.2 I] &, 0, 30]]
(* 0, 0.282843, 0.344093, 0.351367, 0.327239, 0.304778, 0.303605,
0.311545, 0.316158, 0.315818, 0.313773, 0.312729, 0.31295, 0.313482,
0.313697, 0.313611, 0.313477, 0.313435, 0.313464, 0.313497, 0.313504,
0.313495, 0.313487, 0.313486, 0.313489, 0.313491, 0.313491, 0.31349,
0.31349, 0.31349, 0.31349 *)


As you can see, it converges to a value inside your radius. That's why your function doesn't terminate.






share|improve this answer









$endgroup$




















    1












    $begingroup$

    You could also use MandelbrotSetPlot to create Szabolcs' graphic:



    MandelbrotSetPlot[-0.6 + 0.4 I, -0.4 + 0.6 I, PlotLegends -> Automatic]


    enter image description here






    share|improve this answer









    $endgroup$













      Your Answer








      StackExchange.ready(function()
      var channelOptions =
      tags: "".split(" "),
      id: "387"
      ;
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function()
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled)
      StackExchange.using("snippets", function()
      createEditor();
      );

      else
      createEditor();

      );

      function createEditor()
      StackExchange.prepareEditor(
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: false,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      bindNavPrevention: true,
      postfix: "",
      imageUploader:
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      ,
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      );



      );













      draft saved

      draft discarded


















      StackExchange.ready(
      function ()
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194872%2fevaluating-number-of-iteration-with-a-certain-map-with-while%23new-answer', 'question_page');

      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      7












      $begingroup$

      The problem with your code is that for some values of c, Abs[z] will never become larger than 2. You need to cap the number of iterations.




      For this type of iteration, the typical function to use is Nest and related functions.



      countIter[c_] := 
      Length@NestWhileList[
      #^2 + c &,
      0.0,
      Abs[#] <= 2 &,
      1,
      100 (* limit number of iterations to 100 *)
      ]

      result =
      Table[
      countIter[re + im I],
      re, -0.6, -0.4, 0.2/100,
      im, 0.4, 0.6, 0.2/100
      ];

      ArrayPlot[result, ColorFunction -> "Rainbow"]


      enter image description here




      However, this type of problem is quite amenable to compilation with Compile. When using Compile, the usual advice does not apply: a procedural style is still the best. (This does not mean that For is good, I'd still argue against that. But there are many other procedural constructs such as Do and While).



      countIterCompiled = Compile[c, _Complex,
      Block[z = 0.0 + 0.0 I, i = 0,
      While[i <= 100 && Abs[z] <= 2,
      z = z^2 + c;
      i++
      ];
      i
      ]
      ]


      Using countIterCompiled will be much faster than countIter.






      share|improve this answer











      $endgroup$












      • $begingroup$
        thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
        $endgroup$
        – JacquesLeen
        Apr 9 at 15:33










      • $begingroup$
        @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
        $endgroup$
        – Szabolcs
        Apr 9 at 15:59















      7












      $begingroup$

      The problem with your code is that for some values of c, Abs[z] will never become larger than 2. You need to cap the number of iterations.




      For this type of iteration, the typical function to use is Nest and related functions.



      countIter[c_] := 
      Length@NestWhileList[
      #^2 + c &,
      0.0,
      Abs[#] <= 2 &,
      1,
      100 (* limit number of iterations to 100 *)
      ]

      result =
      Table[
      countIter[re + im I],
      re, -0.6, -0.4, 0.2/100,
      im, 0.4, 0.6, 0.2/100
      ];

      ArrayPlot[result, ColorFunction -> "Rainbow"]


      enter image description here




      However, this type of problem is quite amenable to compilation with Compile. When using Compile, the usual advice does not apply: a procedural style is still the best. (This does not mean that For is good, I'd still argue against that. But there are many other procedural constructs such as Do and While).



      countIterCompiled = Compile[c, _Complex,
      Block[z = 0.0 + 0.0 I, i = 0,
      While[i <= 100 && Abs[z] <= 2,
      z = z^2 + c;
      i++
      ];
      i
      ]
      ]


      Using countIterCompiled will be much faster than countIter.






      share|improve this answer











      $endgroup$












      • $begingroup$
        thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
        $endgroup$
        – JacquesLeen
        Apr 9 at 15:33










      • $begingroup$
        @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
        $endgroup$
        – Szabolcs
        Apr 9 at 15:59













      7












      7








      7





      $begingroup$

      The problem with your code is that for some values of c, Abs[z] will never become larger than 2. You need to cap the number of iterations.




      For this type of iteration, the typical function to use is Nest and related functions.



      countIter[c_] := 
      Length@NestWhileList[
      #^2 + c &,
      0.0,
      Abs[#] <= 2 &,
      1,
      100 (* limit number of iterations to 100 *)
      ]

      result =
      Table[
      countIter[re + im I],
      re, -0.6, -0.4, 0.2/100,
      im, 0.4, 0.6, 0.2/100
      ];

      ArrayPlot[result, ColorFunction -> "Rainbow"]


      enter image description here




      However, this type of problem is quite amenable to compilation with Compile. When using Compile, the usual advice does not apply: a procedural style is still the best. (This does not mean that For is good, I'd still argue against that. But there are many other procedural constructs such as Do and While).



      countIterCompiled = Compile[c, _Complex,
      Block[z = 0.0 + 0.0 I, i = 0,
      While[i <= 100 && Abs[z] <= 2,
      z = z^2 + c;
      i++
      ];
      i
      ]
      ]


      Using countIterCompiled will be much faster than countIter.






      share|improve this answer











      $endgroup$



      The problem with your code is that for some values of c, Abs[z] will never become larger than 2. You need to cap the number of iterations.




      For this type of iteration, the typical function to use is Nest and related functions.



      countIter[c_] := 
      Length@NestWhileList[
      #^2 + c &,
      0.0,
      Abs[#] <= 2 &,
      1,
      100 (* limit number of iterations to 100 *)
      ]

      result =
      Table[
      countIter[re + im I],
      re, -0.6, -0.4, 0.2/100,
      im, 0.4, 0.6, 0.2/100
      ];

      ArrayPlot[result, ColorFunction -> "Rainbow"]


      enter image description here




      However, this type of problem is quite amenable to compilation with Compile. When using Compile, the usual advice does not apply: a procedural style is still the best. (This does not mean that For is good, I'd still argue against that. But there are many other procedural constructs such as Do and While).



      countIterCompiled = Compile[c, _Complex,
      Block[z = 0.0 + 0.0 I, i = 0,
      While[i <= 100 && Abs[z] <= 2,
      z = z^2 + c;
      i++
      ];
      i
      ]
      ]


      Using countIterCompiled will be much faster than countIter.







      share|improve this answer














      share|improve this answer



      share|improve this answer








      edited Apr 9 at 14:49

























      answered Apr 9 at 14:43









      SzabolcsSzabolcs

      164k14448950




      164k14448950











      • $begingroup$
        thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
        $endgroup$
        – JacquesLeen
        Apr 9 at 15:33










      • $begingroup$
        @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
        $endgroup$
        – Szabolcs
        Apr 9 at 15:59
















      • $begingroup$
        thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
        $endgroup$
        – JacquesLeen
        Apr 9 at 15:33










      • $begingroup$
        @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
        $endgroup$
        – Szabolcs
        Apr 9 at 15:59















      $begingroup$
      thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
      $endgroup$
      – JacquesLeen
      Apr 9 at 15:33




      $begingroup$
      thank u very much for the suggestion... I previously had a similar idea using Module instead of Block, and the problem was that the exercise did not specify that for many values the map was converging so I had to cap the number of iterations.
      $endgroup$
      – JacquesLeen
      Apr 9 at 15:33












      $begingroup$
      @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
      $endgroup$
      – Szabolcs
      Apr 9 at 15:59




      $begingroup$
      @JacquesLeen Maybe that was part of the exercise: will you discover it on your own? Inside Compile, Module and Block are the same, I think. (Not outside of it.)
      $endgroup$
      – Szabolcs
      Apr 9 at 15:59











      3












      $begingroup$

      For iterated function systems like this, Nest and relatives are the preferred tools. Just exploring your (rather famous) map:



      f[z_, c_] := z^2 + c
      Abs[NestList[f[#, 0.2 + 0.2 I] &, 0, 30]]
      (* 0, 0.282843, 0.344093, 0.351367, 0.327239, 0.304778, 0.303605,
      0.311545, 0.316158, 0.315818, 0.313773, 0.312729, 0.31295, 0.313482,
      0.313697, 0.313611, 0.313477, 0.313435, 0.313464, 0.313497, 0.313504,
      0.313495, 0.313487, 0.313486, 0.313489, 0.313491, 0.313491, 0.31349,
      0.31349, 0.31349, 0.31349 *)


      As you can see, it converges to a value inside your radius. That's why your function doesn't terminate.






      share|improve this answer









      $endgroup$

















        3












        $begingroup$

        For iterated function systems like this, Nest and relatives are the preferred tools. Just exploring your (rather famous) map:



        f[z_, c_] := z^2 + c
        Abs[NestList[f[#, 0.2 + 0.2 I] &, 0, 30]]
        (* 0, 0.282843, 0.344093, 0.351367, 0.327239, 0.304778, 0.303605,
        0.311545, 0.316158, 0.315818, 0.313773, 0.312729, 0.31295, 0.313482,
        0.313697, 0.313611, 0.313477, 0.313435, 0.313464, 0.313497, 0.313504,
        0.313495, 0.313487, 0.313486, 0.313489, 0.313491, 0.313491, 0.31349,
        0.31349, 0.31349, 0.31349 *)


        As you can see, it converges to a value inside your radius. That's why your function doesn't terminate.






        share|improve this answer









        $endgroup$















          3












          3








          3





          $begingroup$

          For iterated function systems like this, Nest and relatives are the preferred tools. Just exploring your (rather famous) map:



          f[z_, c_] := z^2 + c
          Abs[NestList[f[#, 0.2 + 0.2 I] &, 0, 30]]
          (* 0, 0.282843, 0.344093, 0.351367, 0.327239, 0.304778, 0.303605,
          0.311545, 0.316158, 0.315818, 0.313773, 0.312729, 0.31295, 0.313482,
          0.313697, 0.313611, 0.313477, 0.313435, 0.313464, 0.313497, 0.313504,
          0.313495, 0.313487, 0.313486, 0.313489, 0.313491, 0.313491, 0.31349,
          0.31349, 0.31349, 0.31349 *)


          As you can see, it converges to a value inside your radius. That's why your function doesn't terminate.






          share|improve this answer









          $endgroup$



          For iterated function systems like this, Nest and relatives are the preferred tools. Just exploring your (rather famous) map:



          f[z_, c_] := z^2 + c
          Abs[NestList[f[#, 0.2 + 0.2 I] &, 0, 30]]
          (* 0, 0.282843, 0.344093, 0.351367, 0.327239, 0.304778, 0.303605,
          0.311545, 0.316158, 0.315818, 0.313773, 0.312729, 0.31295, 0.313482,
          0.313697, 0.313611, 0.313477, 0.313435, 0.313464, 0.313497, 0.313504,
          0.313495, 0.313487, 0.313486, 0.313489, 0.313491, 0.313491, 0.31349,
          0.31349, 0.31349, 0.31349 *)


          As you can see, it converges to a value inside your radius. That's why your function doesn't terminate.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered Apr 9 at 14:49









          John DotyJohn Doty

          7,57811124




          7,57811124





















              1












              $begingroup$

              You could also use MandelbrotSetPlot to create Szabolcs' graphic:



              MandelbrotSetPlot[-0.6 + 0.4 I, -0.4 + 0.6 I, PlotLegends -> Automatic]


              enter image description here






              share|improve this answer









              $endgroup$

















                1












                $begingroup$

                You could also use MandelbrotSetPlot to create Szabolcs' graphic:



                MandelbrotSetPlot[-0.6 + 0.4 I, -0.4 + 0.6 I, PlotLegends -> Automatic]


                enter image description here






                share|improve this answer









                $endgroup$















                  1












                  1








                  1





                  $begingroup$

                  You could also use MandelbrotSetPlot to create Szabolcs' graphic:



                  MandelbrotSetPlot[-0.6 + 0.4 I, -0.4 + 0.6 I, PlotLegends -> Automatic]


                  enter image description here






                  share|improve this answer









                  $endgroup$



                  You could also use MandelbrotSetPlot to create Szabolcs' graphic:



                  MandelbrotSetPlot[-0.6 + 0.4 I, -0.4 + 0.6 I, PlotLegends -> Automatic]


                  enter image description here







                  share|improve this answer












                  share|improve this answer



                  share|improve this answer










                  answered Apr 9 at 16:01









                  Carl WollCarl Woll

                  74.3k399194




                  74.3k399194



























                      draft saved

                      draft discarded
















































                      Thanks for contributing an answer to Mathematica Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid …


                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.

                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function ()
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194872%2fevaluating-number-of-iteration-with-a-certain-map-with-while%23new-answer', 'question_page');

                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      Popular posts from this blog

                      Magento 1.9 observer on only new product added ( no updated product )Admin Create New Order ObserverObserver checkout_cart_product_add_after get product quantity in cartHow can I differentiate between product creation and saving existing products?How to get the original price Product SaveBeforeMagento Observer for Admin Sales order Address updateHow do i get quantity in a product_save_after event observer magento2?Using observer event to get updated customer infoSave product observer - detect availabilityEvent not triggered when new product added in admin : Magento 2magento 1.9 observer on quantity product change

                      Adding contour labels to SpatialLinesDataFrame or sf object? The Next CEO of Stack OverflowTearing of SpatialLinesDataFrame and problem with gClip functionAutomatically adjusting map labelsExtracting data.frame from simple features object in RR convert sf object back to SpatialPolygonsDataFrameSimplify polygons of sf objectlines of a SpatialLinesDataFrame corresponding to pointsCropping sf object in R?Pattern matching with grepl on SpatialPolygonsDataFrame object in RHow to create and empty SpatialLinesDataFrame in RWarning message in raster::rotate(): “this does not look like an appropriate object for this function”

                      Does an object always see its latest internal state irrespective of thread? The 2019 Stack Overflow Developer Survey Results Are InDoes a finally block always get executed in Java?Java: serial thread confinement questionJava difference between fixed threadpool and scheduled threadpoolJackrabbit and concurrent modificationHow to stop a Runnable scheduled for repeated execution after a certain number of executionsMultiple threads accessing inner classHow can a loop be completed by two thread? say loop from count=1 to count=4 by ist thread and count =5 to 8 by 2nd thread?If I keep a reference to a Runnable, when does the Thread it ran on get released?How to stop a schedule ScheduledExecutorServiceHow to implement a singleThreadedScheduledExcecutor in wildfly