Artin–Schreier theory: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Kilom691
m ref modified
 
en>Yobot
m References: WP:CHECKWIKI error fixes - Replaced endash with hyphen in sortkey per WP:MCSTJR using AWB (9100)
Line 1: Line 1:
Nice to satisfy you, my name is Refugia. One of the extremely very best issues in the globe for me is to do [http://healthfinder.gov/HealthTopics/Topic.aspx?id=32 aerobics] and I've been performing it for fairly a whilst. She is a librarian but  at [http://raybana.com/chat/pg/profile/GIsaachse over the counter std test] home std testing she's  home std test kit usually wanted her own company. Her family members life in Minnesota.<br><br>[http://Www.menstruation.com.au/fertility/stdlist.html Feel free] to [http://www.hotporn123.com/user/KGottscha http://www.hotporn123.com/user/KGottscha] surf to my blog post [http://chorokdeul.co.kr/index.php?document_srl=454418&mid=customer21 http://chorokdeul.co.kr/index.php?document_srl=454418&mid=customer21]
{{no footnotes|date=June 2013}}
[[Image:Michael Wu - TinkerBellMapGraph.gif|thumb|right|Tinkerbell attractor with a=0.9, b=-0.6013, c=2, d=0.5. Used starting values of <math>x_0 = -0.72</math> and <math>y_0 = -0.64</math>.]]
The '''Tinkerbell map''' is a discrete-time [[dynamical system]] given by:
 
:<math>x_{n+1}=x_n^2-y_n^2+ax_n+by_n\,</math>
 
:<math>y_{n+1}=2x_ny_n+cx_n+dy_n\,</math>
 
Some commonly used values of a, b, c, and d are
 
*<math>a=0.9, b=-0.6013, c=2.0, d=0.50</math>
*<math>a=0.3, b=0.6000, c=2.0, d=0.27</math>
 
Like all chaotic maps, the Tinkerbell Map has also been shown to have periods; after a certain number of mapping iterations any given point shown in the map to the right will find itself once again at its starting location.
 
The origin of the name is uncertain; however, the graphical picture of the system (as shown to the right) shows a similarity to the movement of [[Tinker Bell]] over [[Cinderella Castle]], as shown at the beginning of all films produced by Disney.
 
==Source code==
The Java source code that was used to generate the Tinkerbell Map displayed above:
<source lang="java">
import java.io.*;
 
public class TinkerBellMap {
  public static void main(String[] args) throws Exception {
    FileWriter fstream = new FileWriter("TinkerBellMapOutput.txt");
    BufferedWriter out = new BufferedWriter(fstream);
    int time = 0, iterations = 50000;
    double x = -0.72, y = -0.64;
    double a = 0.9, b = -0.6013, c = 2.0, d = 0.5;
    while (time < iterations) {
      double oldX = x;
      x = Math.pow(x,2)-Math.pow(y,2)+a*x+b*y;
      y = 2*oldX*y+c*oldX+d*y;
      out.write(x+" "+y+"\n"); //writing data to a txt file to be read by Mathematica
      time++;
    }
  }
}
</source>
 
==See also==
* [[List of chaotic maps]]
 
== References ==
* [http://www.macalester.edu/~kaplan/preprints/bremer.pdf C.L. Bremer & D.T. Kaplan, ''Markov Chain Monte Carlo Estimation of Nonlinear Dynamics from Time Series'']
* K.T. Alligood, T.D. Sauer & J.A. Yorke, ''Chaos: An Introduction to Dynamical Systems'', Berlin: Springer-Verlag, 1996.
* [http://www.maths.ox.ac.uk/~mcsharry/papers/dynsys18n3p191y2003mcsharry.pdf P.E. McSharry & P.R.C. Ruffino, ''Asymptotic angular stability in non-linear systems: rotation numbers and winding numbers'']
* [http://chaos1.la.asu.edu/~yclai/papers/PLA_01_DLKB.pdf R.L. Davidchack, Y.-C. Lai, A. Klebanoff & E.M. Bollt, ''Towards complete detection of unstable periodic orbits in chaotic systems'']
* B. R. Hunt, Judy A. Kennedy, Tien-Yien Li, Helena E. Nusse, "SLYRB measures: natural invariant measures for chaotic systems"
* [http://www.goldsztejn.com/publications/SIADS2011.pdf A. Goldsztejn, W. Hayes, P. Collins "Tinkerbell is Chaotic" SIAM J. Applied Dynamical Systems 10, n.4 1480-1501, 2011]
 
   
 
{{Chaos theory}}
 
[[Category:Chaotic maps]]
 
{{Mathapplied-stub}}

Revision as of 13:45, 20 April 2013

Template:No footnotes

File:Michael Wu - TinkerBellMapGraph.gif
Tinkerbell attractor with a=0.9, b=-0.6013, c=2, d=0.5. Used starting values of x0=0.72 and y0=0.64.

The Tinkerbell map is a discrete-time dynamical system given by:

xn+1=xn2yn2+axn+byn
yn+1=2xnyn+cxn+dyn

Some commonly used values of a, b, c, and d are

Like all chaotic maps, the Tinkerbell Map has also been shown to have periods; after a certain number of mapping iterations any given point shown in the map to the right will find itself once again at its starting location.

The origin of the name is uncertain; however, the graphical picture of the system (as shown to the right) shows a similarity to the movement of Tinker Bell over Cinderella Castle, as shown at the beginning of all films produced by Disney.

Source code

The Java source code that was used to generate the Tinkerbell Map displayed above:

import java.io.*;

public class TinkerBellMap {
  public static void main(String[] args) throws Exception {
    FileWriter fstream = new FileWriter("TinkerBellMapOutput.txt");
    BufferedWriter out = new BufferedWriter(fstream);
    int time = 0, iterations = 50000;
    double x = -0.72, y = -0.64;
    double a = 0.9, b = -0.6013, c = 2.0, d = 0.5;
    while (time < iterations) {
      double oldX = x;
      x = Math.pow(x,2)-Math.pow(y,2)+a*x+b*y;
      y = 2*oldX*y+c*oldX+d*y;
      out.write(x+" "+y+"\n"); //writing data to a txt file to be read by Mathematica
      time++;
    }
  }
}

See also

References


Template:Chaos theory

Template:Mathapplied-stub