# Finding Strange Attractors of Iterated Maps

Finding Strange Attractors of Iterated Maps

This Demonstration searches for strange attractors of a nonlinear two-dimensional polynomial map. Both the and the polynomial maps of degree are defined by (n+1)(n+2) coefficients , one for each term , , .

x

y

n

1

2

c

ij

i

x

j

y

i,j=0,1,…,n

i+j≤n

To find an attractor, we compare two orbits of the map with the same coefficients but starting from nearby initial points. If the orbits become unbounded or move apart, another set of random coefficients is selected. If successive iterations move the orbits increasingly closer together, an attractor is detected and plotted and the search is stopped.