Ikeda map

Last updated
The trajectories of 2000 random points in an Ikeda map with u = 0.918. Ikeda map simulation u=0.918 cropped.png
The trajectories of 2000 random points in an Ikeda map with u = 0.918.

In physics and mathematics, the Ikeda map is a discrete-time dynamical system given by the complex map

Contents

The original map was proposed first by Kensuke Ikeda as a model of light going around across a nonlinear optical resonator (ring cavity containing a nonlinear dielectric medium) in a more general form. It is reduced to the above simplified "normal" form by Ikeda, Daido and Akimoto [1] [2] stands for the electric field inside the resonator at the n-th step of rotation in the resonator, and and are parameters which indicate laser light applied from the outside, and linear phase across the resonator, respectively. In particular the parameter is called dissipation parameter characterizing the loss of resonator, and in the limit of the Ikeda map becomes a conservative map.

The original Ikeda map is often used in another modified form in order to take the saturation effect of nonlinear dielectric medium into account:

A 2D real example of the above form is:

where u is a parameter and

For , this system has a chaotic attractor.

Attractor

This animation shows how the attractor of the system changes as the parameter is varied from 0.0 to 1.0 in steps of 0.01. The Ikeda dynamical system is simulated for 500 steps, starting from 20000 randomly placed starting points. The last 20 points of each trajectory are plotted to depict the attractor. Note the bifurcation of attractor points as is increased.

u
=
0.3
{\displaystyle u=0.3} Ikeda0300.png
u
=
0.5
{\displaystyle u=0.5} Ikeda0500.png
u
=
0.7
{\displaystyle u=0.7} Ikeda0700.png
u
=
0.9
{\displaystyle u=0.9} Ikeda0900.png

Point trajectories

The plots below show trajectories of 200 random points for various values of . The inset plot on the left shows an estimate of the attractor while the inset on the right shows a zoomed in view of the main trajectory plot.

u = 0.1 Ikeda sim u0.1.png
u = 0.1
u = 0.5 Ikeda sim u0.5.png
u = 0.5
u = 0.65 Ikeda sim u0.65.png
u = 0.65
u = 0.7 Ikeda sim u0.7.png
u = 0.7
u = 0.8 Ikeda sim u0.8.png
u = 0.8
u = 0.85 Ikeda sim u0.85.png
u = 0.85
u = 0.9 Ikeda sim u0.9.png
u = 0.9
u = 0.908 Ikeda sim u0.908.png
u = 0.908
u = 0.92 Ikeda sim u0.92.png
u = 0.92

Octave/MATLAB code for point trajectories

The Ikeda map is composed by a rotation (by a radius-dependent angle), a rescaling, and a shift. This "stretch and fold" process gives rise to the strange attractor.

The Octave/MATLAB code to generate these plots is given below:

% u = ikeda parameter% option = what to plot%  'trajectory' - plot trajectory of random starting points%  'limit' - plot the last few iterations of random starting pointsfunctionikeda(u, option)P=200;% how many starting pointsN=1000;% how many iterationsNlimit=20;% plot these many last points for 'limit' optionx=randn(1,P)*10;% the random starting pointsy=randn(1,P)*10;forn=1:P,X=compute_ikeda_trajectory(u,x(n),y(n),N);switchoptioncase'trajectory'% plot the trajectories of a bunch of pointsplot_ikeda_trajectory(X);holdon;case'limit'plot_limit(X,Nlimit);holdon;otherwisedisp('Not implemented');endendaxistight;axisequaltext(-25,-15,['u = 'num2str(u)]);text(-25,-18,['N = 'num2str(N)' iterations']);end% Plot the last n points of the curve - to see end point or limit cyclefunctionplot_limit(X, n)plot(X(end-n:end,1),X(end-n:end,2),'ko');end% Plot the whole trajectoryfunctionplot_ikeda_trajectory(X)plot(X(:,1),X(:,2),'k');% hold on; plot(X(1,1), X(1,2), 'bo', 'markerfacecolor', 'g'); hold offend% u is the ikeda parameter% x,y is the starting point% N is the number of iterationsfunction[X]=compute_ikeda_trajectory(u, x, y, N)X=zeros(N,2);X(1,:)=[xy];forn=2:Nt=0.4-6/(1+x^2+y^2);x1=1+u*(x*cos(t)-y*sin(t));y1=u*(x*sin(t)+y*cos(t));x=x1;y=y1;X(n,:)=[xy];endend


Python code for point trajectories

importmathimportmatplotlib.pyplotaspltimportnumpyasnpdefmain(u:float,points=200,iterations=1000,nlim=20,limit=False,title=True):"""    Args:        u:float            ikeda parameter        points:int            number of starting points        iterations:int            number of iterations        nlim:int            plot these many last points for 'limit' option. Will plot all points if set to zero        limit:bool            plot the last few iterations of random starting points if True. Else Plot trajectories.        title:[str, NoneType]            display the name of the plot if the value is affirmative    """x=10*np.random.randn(points,1)y=10*np.random.randn(points,1)forninrange(points):X=compute_ikeda_trajectory(u,x[n][0],y[n][0],iterations)iflimit:plot_limit(X,nlim)tx,ty=2.5,-1.8else:plot_ikeda_trajectory(X)tx,ty=-30,-26plt.title(f"Ikeda Map ({u=:.2g}, {iterations=})")iftitleelseNonereturnpltdefcompute_ikeda_trajectory(u:float,x:float,y:float,N:int):"""Calculate a full trajectory    Args:        u - is the ikeda parameter        x, y - coordinates of the starting point        N - the number of iterations    Returns:        An array.    """X=np.zeros((N,2))forninrange(N):X[n]=np.array((x,y))t=0.4-6/(1+x**2+y**2)x1=1+u*(x*math.cos(t)-y*math.sin(t))y1=u*(x*math.sin(t)+y*math.cos(t))x=x1y=y1returnXdefplot_limit(X,n:int)->None:"""    Plot the last n points of the curve - to see end point or limit cycle    Args:        X: np.array            trajectory of an associated starting-point        n: int            number of "last" points to plot    """plt.plot(X[-n:,0],X[-n:,1],'ko')defplot_ikeda_trajectory(X)->None:"""    Plot the whole trajectory    Args:        X: np.array            trajectory of an associated starting-point    """plt.plot(X[:,0],X[:,1],"k")if__name__=="__main__":main(0.9,limit=True,nlim=0).show()

Related Research Articles

<span class="mw-page-title-main">Cumulative distribution function</span> Probability that random variable X is less than or equal to x

In probability theory and statistics, the cumulative distribution function (CDF) of a real-valued random variable , or just distribution function of , evaluated at , is the probability that will take a value less than or equal to .

<span class="mw-page-title-main">Ellipse</span> Plane curve: conic section

In mathematics, an ellipse is a plane curve surrounding two focal points, such that for all points on the curve, the sum of the two distances to the focal points is a constant. It generalizes a circle, which is the special type of ellipse in which the two focal points are the same. The elongation of an ellipse is measured by its eccentricity , a number ranging from to .

<span class="mw-page-title-main">Probability density function</span> Function whose integral over a region describes the probability of an event occurring in that region

In probability theory, a probability density function (PDF), density function, or density of an absolutely continuous random variable, is a function whose value at any given sample in the sample space can be interpreted as providing a relative likelihood that the value of the random variable would be equal to that sample. Probability density is the probability per unit length, in other words, while the absolute likelihood for a continuous random variable to take on any particular value is 0, the value of the PDF at two different samples can be used to infer, in any particular draw of the random variable, how much more likely it is that the random variable would be close to one sample compared to the other sample.

Orbital elements are the parameters required to uniquely identify a specific orbit. In celestial mechanics these elements are considered in two-body systems using a Kepler orbit. There are many different ways to mathematically describe the same orbit, but certain schemes, each consisting of a set of six parameters, are commonly used in astronomy and orbital mechanics.

In mathematics, a Gaussian function, often simply referred to as a Gaussian, is a function of the base form

<span class="mw-page-title-main">Beta function</span> Mathematical function

In mathematics, the beta function, also called the Euler integral of the first kind, is a special function that is closely related to the gamma function and to binomial coefficients. It is defined by the integral

In mathematics, the Jacobi elliptic functions are a set of basic elliptic functions. They are found in the description of the motion of a pendulum, as well as in the design of electronic elliptic filters. While trigonometric functions are defined with reference to a circle, the Jacobi elliptic functions are a generalization which refer to other conic sections, the ellipse in particular. The relation to trigonometric functions is contained in the notation, for example, by the matching notation for . The Jacobi elliptic functions are used more often in practical problems than the Weierstrass elliptic functions as they do not require notions of complex analysis to be defined and/or understood. They were introduced by Carl Gustav Jakob Jacobi. Carl Friedrich Gauss had already studied special Jacobi elliptic functions in 1797, the lemniscate elliptic functions in particular, but his work was published much later.

<span class="mw-page-title-main">Parametric equation</span> Representation of a curve by a function of a parameter

In mathematics, a parametric equation defines a group of quantities as functions of one or more independent variables called parameters. Parametric equations are commonly used to express the coordinates of the points that make up a geometric object such as a curve or surface, called a parametric curve and parametric surface, respectively. In such cases, the equations are collectively called a parametric representation, or parametric system, or parameterization of the object.

In mathematics, the Lévy C curve is a self-similar fractal curve that was first described and whose differentiability properties were analysed by Ernesto Cesàro in 1906 and Georg Faber in 1910, but now bears the name of French mathematician Paul Lévy, who was the first to describe its self-similarity properties as well as to provide a geometrical construction showing it as a representative curve in the same class as the Koch curve. It is a special case of a period-doubling curve, a de Rham curve.

Random sample consensus (RANSAC) is an iterative method to estimate parameters of a mathematical model from a set of observed data that contains outliers, when outliers are to be accorded no influence on the values of the estimates. Therefore, it also can be interpreted as an outlier detection method. It is a non-deterministic algorithm in the sense that it produces a reasonable result only with a certain probability, with this probability increasing as more iterations are allowed. The algorithm was first published by Fischler and Bolles at SRI International in 1981. They used RANSAC to solve the Location Determination Problem (LDP), where the goal is to determine the points in the space that project onto an image into a set of landmarks with known locations.

<span class="mw-page-title-main">Stable distribution</span> Distribution of variables which satisfies a stability property under linear combinations

In probability theory, a distribution is said to be stable if a linear combination of two independent random variables with this distribution has the same distribution, up to location and scale parameters. A random variable is said to be stable if its distribution is stable. The stable distribution family is also sometimes referred to as the Lévy alpha-stable distribution, after Paul Lévy, the first mathematician to have studied it.

<span class="mw-page-title-main">Buddhabrot</span> Probability distribution over the trajectories of points that escape the Mandelbrot fractal

The Buddhabrot is the probability distribution over the trajectories of points that escape the Mandelbrot fractal. Its name reflects its pareidolic resemblance to classical depictions of Gautama Buddha, seated in a meditation pose with a forehead mark (tikka), a traditional oval crown (ushnisha), and ringlet of hair.

von Mises distribution Probability distribution on the circle

In probability theory and directional statistics, the von Mises distribution is a continuous probability distribution on the circle. It is a close approximation to the wrapped normal distribution, which is the circular analogue of the normal distribution. A freely diffusing angle on a circle is a wrapped normally distributed random variable with an unwrapped variance that grows linearly in time. On the other hand, the von Mises distribution is the stationary distribution of a drift and diffusion process on the circle in a harmonic potential, i.e. with a preferred orientation. The von Mises distribution is the maximum entropy distribution for circular data when the real and imaginary parts of the first circular moment are specified. The von Mises distribution is a special case of the von Mises–Fisher distribution on the N-dimensional sphere.

<span class="mw-page-title-main">Newton fractal</span> Boundary set in the complex plane

The Newton fractal is a boundary set in the complex plane which is characterized by Newton's method applied to a fixed polynomial p(z) ∈ [z] or transcendental function. It is the Julia set of the meromorphic function zzp(z)/p′(z) which is given by Newton's method. When there are no attractive cycles (of order greater than 1), it divides the complex plane into regions Gk, each of which is associated with a root ζk of the polynomial, k = 1, …, deg(p). In this way the Newton fractal is similar to the Mandelbrot set, and like other fractals it exhibits an intricate appearance arising from a simple description. It is relevant to numerical analysis because it shows that (outside the region of quadratic convergence) the Newton method can be very sensitive to its choice of start point.

In Itô calculus, the Euler–Maruyama method is a method for the approximate numerical solution of a stochastic differential equation (SDE). It is an extension of the Euler method for ordinary differential equations to stochastic differential equations. It is named after Leonhard Euler and Gisiro Maruyama. Unfortunately, the same generalization cannot be done for any arbitrary deterministic method.

In mathematics, the Milstein method is a technique for the approximate numerical solution of a stochastic differential equation. It is named after Grigori N. Milstein who first published it in 1974.

<span class="mw-page-title-main">Beta-binomial distribution</span> Discrete probability distribution

In probability theory and statistics, the beta-binomial distribution is a family of discrete probability distributions on a finite support of non-negative integers arising when the probability of success in each of a fixed or known number of Bernoulli trials is either unknown or random. The beta-binomial distribution is the binomial distribution in which the probability of success at each of n trials is not fixed but randomly drawn from a beta distribution. It is frequently used in Bayesian statistics, empirical Bayes methods and classical statistics to capture overdispersion in binomial type distributed data.

The Marsaglia polar method is a pseudo-random number sampling method for generating a pair of independent standard normal random variables.

The Lorenz 96 model is a dynamical system formulated by Edward Lorenz in 1996. It is defined as follows. For :

The GEKKO Python package solves large-scale mixed-integer and differential algebraic equations with nonlinear programming solvers. Modes of operation include machine learning, data reconciliation, real-time optimization, dynamic simulation, and nonlinear model predictive control. In addition, the package solves Linear programming (LP), Quadratic programming (QP), Quadratically constrained quadratic program (QCQP), Nonlinear programming (NLP), Mixed integer programming (MIP), and Mixed integer linear programming (MILP). GEKKO is available in Python and installed with pip from PyPI of the Python Software Foundation.

References

  1. Ikeda, Kensuke (1979). "Multiple-valued stationary state and its instability of the transmitted light by a ring cavity system". Optics Communications. 30 (2). Elsevier BV: 257–261. Bibcode:1979OptCo..30..257I. CiteSeerX   10.1.1.158.7964 . doi:10.1016/0030-4018(79)90090-7. ISSN   0030-4018.
  2. Ikeda, K.; Daido, H.; Akimoto, O. (1980-09-01). "Optical Turbulence: Chaotic Behavior of Transmitted Light from a Ring Cavity". Physical Review Letters. 45 (9). American Physical Society (APS): 709–712. Bibcode:1980PhRvL..45..709I. doi:10.1103/physrevlett.45.709. ISSN   0031-9007.