MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Chaos-to-order (cont'd)

  • To: mathgroup at
  • Subject: [mg27367] Chaos-to-order (cont'd)
  • From: Roberto Brambilla <rlbrambilla at>
  • Date: Thu, 22 Feb 2001 02:25:11 -0500 (EST)
  • Sender: owner-wri-mathgroup at

refeerring to my previous e-mail [mg27308]
and taking into account suggestions of some of 
you, I have the points orbit in te unit square 

T[t_]:={{2 Cos[t],Cos[t]-Sin[t]},{Cos[t]+Sin[t],Cos[t]}};
Orbit[t_,p_,n_Integer] := With[{tau = T[t]},
    NestList[Mod[tau.#, 1] &, p, n]

es. two orbits generate by two different initial points:



The two figures looks very different.
Both lists contain 1001 points, but the first suggests that there are
returning points, i.e a finite sequence, or closed orbit. 
In a more coarse precision the first list would have repeated points.
I think that a quick way to detect closed orbits
(or quasi closed orbits) may be counting colored pixels
in the unit square and counting the background white pixels.
But I have not found this kind of functions.
Any idea?
Many thanks, Roberto 
Roberto Brambilla
Via Rubattino 54
20134 Milano
tel +39.2.2125.5875
fax +39.2.2125.610
rlbrambilla at

  • Prev by Date: The usage of emmathfnt on Mac
  • Next by Date: Re: SetDelayed problems with matrix operation
  • Previous by thread: The usage of emmathfnt on Mac
  • Next by thread: Re: A bug of Integrate[] in Mathematica 4.1 (and 4.0)