TOPICS
Search

Search Results for ""


581 - 590 of 1029 for Coordinate SystemsSearch Results
The two-dimensional map x_(n+1) = [x_n+nu(1+muy_n)+epsilonnumucos(2pix_n)] (mod 1) (1) y_(n+1) = e^(-Gamma)[y_n+epsiloncos(2pix_n)], (2) where mu=(1-e^(-Gamma))/Gamma (3) ...
An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...
A two-dimensional map also called the Taylor-Greene-Chirikov map in some of the older literature and defined by I_(n+1) = I_n+Ksintheta_n (1) theta_(n+1) = theta_n+I_(n+1) ...
A flow defined analogously to the Anosov diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...
Consider the circle map. If K is nonzero, then the motion is periodic in some finite region surrounding each rational Omega. This execution of periodic motion in response to ...
The best known example of an Anosov diffeomorphism. It is given by the transformation [x_(n+1); y_(n+1)]=[1 1; 1 2][x_n; y_n], (1) where x_(n+1) and y_(n+1) are computed mod ...
Let T be an ergodic endomorphism of the probability space X and let f:X->R be a real-valued measurable function. Then for almost every x in X, we have 1/nsum_(j=1)^nf ...
In homogeneous coordinates, the first positive quadrant joins (0,1) with (1,0) by "points" (f_1,f_2), and is mapped onto the hyperbolic line -infty<u<+infty by the ...
Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...
A dimension also called the fractal dimension, Hausdorff dimension, and Hausdorff-Besicovitch dimension in which nonintegral values are permitted. Objects whose capacity ...
1 ... 56|57|58|59|60|61|62 ... 103 Previous Next

...