DYNAMICAL SYSTEMS Tutorial 17
|
|
- Megan Reed
- 6 years ago
- Views:
Transcription
1 map.nb DYNAMICAL SYSTEMS Tutorial 7 Iterated Maps sysid Mathematica 4..2, DynPac.67, 3ê9ê22 plotreset; intreset; ü Functions and Variables Used in This Tutorial asprat, bifurcmap, bifurc3dmap, bimap, borat, classifymap, cobweb, eigsysmap, eigvalmap, findpolyfi, imsize, intreset, iterate, jacob, jacobval, mapcomp, mapval, nfindfi, nfindpolyfi, parmval, periodmap, phaser, phaser3d, plotreset, plrange, plrange3d, pointcon, portraitmap, portrait3dmap, ptsize, rangeflag, ranger, residualfi, setback, setcolor, setmap, setde, setparm, setstate, slopevec, stripsol, sysid, sysreport, timeplot, and viewmap. ü Description of Systems Used in This Tutorial In this tutorial, our objective is to illustrate the use of the functions defined for iterated mappings. For eamples, we will use the logistic map for a D case, the Henon map for a 2D case, and a combination of the two for a 3D case. In many cases, it is useful to apply some of the functions directly to iterates of the map. For eample, if we are studying a map f[], then one way of finding orbits of period two is to look for fied points of f[f[]]. Most of the functions used in DynPac for mappings allow an optional final argument which is the level of composition desired. We will see a number of eamples of this below. ü Logistic Map The logistic map is discussed in many references. A very complete and readable discussion is given in Chapter of Nonlinear Dynamics and Chaos by Steven Strogatz, Addison-Wesley, 994. Many of the interesting properties of the map were discovered by the mathematical biologist Robert May ("Simple Mathematical Models with Very Complicated Dynamics," Nature 26, 459, 976.) The basic form of the map is n+ = r n ( - n ). As is well-known this map ehibits a wide and interesting range of behavior as r is varied. We define the system for DynPac, starting by the setmap command.
2 map.nb 2 setmap; setstate@8<d; setparm@8r<d; parmval = 83.2<; slopevec = 8r * * H - L<; sysreport SYSTEM DEFINITION H.67L System name sysname = System State vector statevec = 8< State units stateunits = 8< Slope vector slopevec = 8r * H - L * < Parameter vector parmvec = 8r< Parameter values parmval = 83.2< Parameter units vector parmunits = 8< Time unit timeunit = System Type = mapping We could use this same function as the slope for a differential equation. The command set de switches back to differential equation mode. The primary difference in the two modes is the actual stepping algorithm used in constructing solutions -- a Runge-Kutta step for a differential equation, and a map iteration for the mapping. It is only at that basic level of code that the two modes differ. setde; sysreport SYSTEM DEFINITION H.67L System name sysname = System State vector statevec = 8< State units stateunits = 8< Slope vector slopevec = 8r * H - L * < Parameter vector parmvec = 8r< Parameter values parmval = 83.2< Parameter units vector parmunits = 8< Time unit timeunit = System Type = differential equation We return to the map setting.
3 map.nb 3 setmap; We start by viewing the map. viewmap@d; r H - L, 8r<=8 3.2< The picture suggests that there are two fied points -- one at and one between.6 and.8. We find these. Because the mapping is a polynomial, we can use findpolyfi or nfindpolyfi. We can also use the more general nfindfi, which requires an initial guess. findpolyfi@d 98<, 9 ÅÅÅÅÅÅÅÅÅÅÅÅÅÅ - + r == r This gives the answer in terms of the parameter r. To find numerical values we can use nfindpolyfi or nfindfi: nfindpolyfi@d 88.<, << nfindfi@.5d < We can check the accuracy of the fied point by finding the residual with residualfi. residualfi@8.6875<d 8.< Alternatively, we can evaluate the map at the fied point. mapval@8.6875<d <
4 map.nb 4 We check the stability of these two fied points. classifymap@8<d unstable classifymap@8.6875<d unstable Thus both of the fied points are unstable. This could also be determined by the eigenvalues at those points. Any eigenvalue greater than one in magnitude indicates instability. eigvalmap@8<d 83.2< eigvalmap@8.6875<d 8-.2< As neither fied point is stable for this value of r, there might be a periodic orbit. Let's perform a short iteration with a more or less arbitrary intial condition of 3. We ask for 2 iterates with none thrown away. sol = iterate@3,., 2, D 88., 3<, 8.,.56672<, 82., <, 83.,.5387<, 84.,.79527<, 85.,.5229<, 86.,.79857<, 87.,.54736<, 88.,.79935<, 89.,.53333<, 8.,.79943<, 8.,.539<, 82., <, 83.,.5352<, 84., <, 85.,.5346<, 86., <, 87.,.5345<, 88., <, 89.,.5345<, 82., << The answer is in the form of a list pairs, with the first element in each pair being the time coordinate, the second the iterate value. All of the functions in DynPac epect solution lists in this form. If it is desired to form a list without the time coordinate, this can be accomplished by the function stripsol[sol,n], which removes the nth state variable from the list. The time coordinate is associated with n =. We try this. stripsol@sol, D 883<, <, <, <, <, <, <, <, <, <, <, 8.539<, <, <, <, <, <, <, <, <, << It is clear from the solution list that we have an orbit of period 2. DynPac can tell us this also. periodmap@sold Solution contains a periodic orbit; period = 2 Another approach to finding this periodic orbit is to consider the fied points of the first iterated mapping. First we graph it.
5 map.nb 5 viewmap@2d; Comp 2 of r H - L, 8r<=8 3.2< We see four fied points. Of course two will be the fied points of the original map, but the other two should be the points on the period-two orbit of the original map. We check this. nfindpolyfi@2d 88.<, <, <, << We see the same two values that showed up eplicitly in the orbit calculated above. We check the stability of the period two orbit by checking the stability of these as fied points of the second iterated mapping. classifymap@8.5345<, 2D strictly stable classifymap@ <, 2D strictly stable Thus the period two orbit is stable. The last few function evaluations have provided eamples of applying functions to higher compositions of the map -- in this case the second composition. It is the optional last argument 2 that causes this. We haven't yet looked eplicitly at the second composition, although we can do that easily with mapcomp[n], which returns the nth composition. mapcomp@2d 8r 2 H - L H - r H - L L< Now we look at something new. We construct a cobweb plot to show the approach to the stable orbit of period 2. The function to do this is cobweb[initval,niter,ntoss], where initval is the starting point for the iteration, niter is the number of iterations to plot, and ntoss is the the number to calculate and throw away first (to eliminate transients). We start with an initial condition 3, and we ask for iterations, throwing none away before plotting.
6 map.nb 6 cobweb@83<,, D; r H - L, 8r<=8 3.2< We see the eventual approach to the orbit. We can get the pure orbit by throwing away the transients. We perform the same calculation, only now throwing away points first.
7 map.nb 7 cobweb@83<,, D; r H - L, 8r<=8 3.2< Now we get the pure orbit. Let's increase the value of r to 3.5, and carry out a short iteration. parmval = 83.5<; sol2 = iterate@83<,., 3, D 88., 3<, 8.,.6985<, 82., <, 83.,.55936<, 84., <, 85.,.38336<, 86.,.8272<, 87.,.529<, 88.,.875<, 89.,.38283<, 8., <, 8.,.5896<, 82., <, 83.,.38282<, 84.,.82694<, 85.,.5884<, 86., <, 87.,.38282<, 88.,.82694<, 89.,.5884<, 82., <, 82.,.38282<, 822.,.82694<, 823.,.5884<, 824., <, 825.,.38282<, 826.,.82694<, 827.,.5884<, 828., <, 829.,.38282<, 83.,.82694<< A close inspection shows an orbit of period 4. We verify that. periodmap@sol2d Solution contains a periodic orbit; period = 4 The points on the 4-orbit should be fied points of the fourth composition of the map.
8 map.nb 8 nfindpolyfi@4d 88.<, Â<, Â<, Â<, Â<, <, 82857<, <, Â<, Â<, <, <, <, <, Â<, Â<< We find lots of roots. In the interpretation, it helps to look also at the fied points of the basic mapping and the mapping iterated once. nfindpolyfi@2d 88.<, 82857<, <, << nfindpolyfi@d 88.<, << By comparing these, we conclude that () the basic map has fied points f =.; f2 =.74286; (2) the second composition has in addition a period two orbit f2 = 2857; f22 =.85743; and (3) the fourth composition has a period four orbit f4 =.38282; f42 =.5884; f43 =.82694; f44 = ; Thus for r = 3.5, the map has two fied points, a period two orbit and a period four orbit. Yet all we saw in the iteration was the period four orbit. This strongly suggests that it is the only stable attractor. We check the stability of all of these now. classifymap@8f<d unstable classifymap@8f2<d unstable classifymap@8f2<, 2D unstable classifymap@8f22<, 2D unstable classifymap@8f4<, 4D strictly stable classifymap@8f42<, 4D strictly stable
9 map.nb 9 classifymap@8f43<, 4D strictly stable classifymap@8f44<, 4D strictly stable Let's look at a cobweb of this stable period four orbit. cobweb@83<,, D; r H - L, 8r<=8 3.5<.8.6 Now we look at the pure orbit..6.8
10 map.nb D; r H - L, 8r<=8 3.5<.8.6 We increase r again, this time to 3.7. parmval = 83.7<;.6.8
11 map.nb sol3 = iterate@83<,,, D 88, 3<, 8,.65527<, 82, <, 83,.57788<, 84, <, 85, 57393<, 86,.77225<, 87,.7664<, 88, <, 89,.82672<, 8,.5339<, 8,.9266<, 82, 6746<, 83, <, 84,.73873<, 85,.7459<, 86,.75533<, 87, <, 88, <, 89,.59294<, 82,.89369<, 82,.35736<, 822, <, 823, 887<, 824, <, 825, 5836<, 826,.78958<, 827, <, 828,.66826<, 829,.8235<, 83, <, 83,.97383<, 832, 843<, 833,.74669<, 834, <, 835,.77755<, 836,.6499<, 837,.8545<, 838, 67984<, 839,.9227<, 84, 68562<, 84,.72685<, 842, <, 843,.7227<, 844, <, 845,.74995<, 846,.76955<, 847, <, 848, <, 849,.5555<, 85, <, 85, 57983<, 852,.78283<, 853, <, 854,.66672<, 855,.82283<, 856, <, 857,.9926<, 858, 7468<, 859,.7375<, 86,.7786<, 86,.75632<, 862,.69258<, 863, <, 864,.68579<, 865, <, 866, 294<, 867, <, 868,.34749<, 869, <, 87,.592<, 87, <, 872, 5674<, 873,.75986<, 874,.7688<, 875, <, 876,.8383<, 877,.5976<, 878, <, 879, 696<, 88,.7358<, 88,.75628<, 882,.6824<, 883,.823<, 884,.58687<, 885,.89778<, 886,.3469<, 887,.83287<, 888,.5672<, 889, <, 89, 59933<, 89,.7762<, 892,.7598<, 893, <, 894,.89546<, 895,.5747<, 896,.96625<, 897,.33226<, 898, <, 899,.698<, 8,.88727<< Now there is no obvious repetition. We check it for periodicity anyway. periodmap@sol3d Solution does not contain a periodic orbit. Are there fied points? nfindpolyfi@d 88.<, << nfindpolyfi@2d 88.<, <, <, << nfindpolyfi@4d 88.<, Â<, Â<, Â<, Â<, <, <, Â<, Â<, <, <, <, <, <, Â<, Â<< There are two fied points, a period two orbit and a period four orbit. Presumably they are all unstable, since they don't show up in our iteration. Are there orbits of higher period? If we try nfindpolyfi[8], Mathematica goes away for a very long time and returns with a large list of roots, mostly comple, and missing most of the real roots that we already know from above. Let's look at the stability of the orbits we have found. It is sufficient to check just one point on each orbit if that one point is unstable. classifymap@8<d unstable
12 map.nb 2 classifymap@ <d unstable classifymap@8.3922<, 2D unstable classifymap@ <, 4D unstable If this system with r = 3.7 has a stable attractor, we haven't found it yet. We try a cobweb plot. cobweb@83<, 2, D; r H - L, 8r<=8 3.7< This could be chaotic. Let's do a fancy cobweb plot now with color, showing the sensitive dependence on initial conditions. We take 26 initial points in the range [,5], and we assign a gradually varying color from red to blue. First we construct the color list. collist = Table@RGBColor@H - il,, id, 8i,,,.4<D; setcolor@collistd; Now we construct a list of initial conditions.
13 map.nb 3 initvec = Table@ + i, 8i,,.5,.2<D; Now we construct the cobweb plot. plrange = 88, <, 8, <<; asprat = ; cobweb@initvec, 6, D; r H - L, 8r<=8 3.7< We can also make a plot of versus time by using timeplot. We construct a solution with 5 iterates and then plot it as a function of time. plrange = 88, 5<, 8, <<; asprat =.7; setcolor@8black<d; soltime = iterate@83<,,5,d; pointcon = True;
14 map.nb 4 timeplot@soltime, D; Comp 2 of r H - L, 8r<=8 3.7< t pointcon = False; plrange = 88, <, 8, <<; Both the time plot and the cobweb plot show the chaotic nature of this orbit. In particular the cobweb plot shows clearly the spread of an initially compact set of initial conditions. We can get an overview of the behavior of the system with a bifurcation diagram. This produces a graph in which the abcissa is the parameter being varied, and along the ordinate, the iterates are plotted. If we throw away initial transients, the result is a plot of the attractor of the system as a function of the parameter. The function which does this is bimap[npts,ntoss,nparm,name,range,initvec,pname,prange,ncomp]. The arguments are npts, the number of iterates plotted at each parameter value npts and ntoss, the number of transient iterates thrown away before plotting. The number of parameter values plotted is nparm. The name of the state variable plotted is name, and its plotting range is range. The initial condition for the iteration is initvec, which may contain parameter symbols. The name of the parameter being varied is pname, and it is varied through the range prange. The final argument ncomp is optional and specifies the level of function composition of the basic map. Generally for the logistic map about 2 iterates have to be thrown away to get good results, and about to 2 iterates have to be plotted, at about to 2 parameter values. We carry this out for r in the range 2.8 to 4. We ask for a larger image size, for a background color of Wheat, and points plotted in Blue. setback@wheatd; imsize = 4; setcolor@8blue<d; ptsize =.2; asprat =.7;
15 map.nb 5 biout = bimap@2, 2, 2,, 8, <, 83<, r,82.8, 4.<D; 8r H - L < r We see clearly the bifurcation from a stable fied point to a stable orbit of period 2 at r = 3, and then the bifurcation from period two to period four at r between 3.4 and 3.5. The further period doublings occur at decreasing increments in r, and the orbit becomes chaotic for r ª Note the intriguing window just beyond 3.8. Let's eplore this briefly. We set r to We iterate and throw away initial points in an effort to get rid of the transients. parmval = 83.83<; sol4 = iterate@83<,, 3, D 88,.95747<, 8,.5649<, 82,.54666<, 83,.95747<, 84,.5649<, 85,.54666<, 86,.95747<, 87,.5649<, 88,.54666<, 89,.95747<, 8,.5649<, 8,.54666<, 82,.95747<, 83,.5649<, 84,.54666<, 85,.95747<, 86,.5649<, 87,.54666<, 88,.95747<, 89,.5649<, 82,.54666<, 82,.95747<, 822,.5649<, 823,.54666<, 824,.95747<, 825,.5649<, 826,.54666<, 827,.95747<, 828,.5649<, 829,.54666<, 83,.95747<< A surprising result -- a period 3 orbit! periodmap@sol4d Solution is periodic; period = 3 Because we saw it, it surely is stable, but we can check that. classifymap@ <, 3D strictly stable
16 map.nb 6 classifymap@ <, 3D strictly stable classifymap@8.5649<, 3D strictly stable Let's look at the cobweb plot for this. asprat = ; plrange = 88, <, 8, <<; cobweb@83<, 5, D; r H - L, 8r<=8 3.83< Now we throw away the transients and look at the periodic orbit.
17 map.nb 7 cobweb@83<, 5, D; r H - L, 8r<=8 3.83<.8.6 We look at the third iterated mapping..6.8
18 map.nb 8 viewmap@3d; Comp 3 of r H - L, 8r<=8 3.83< nfindpolyfi@d 88.<, << nfindpolyfi@3d 88.<, <, <, <, 8.524<, <, <, << The third iterated map has 8 fied points. Two of these are unstable fied points of the basic map. The other si turn out to be the components of two period 3 orbits, one stable and one unstable. From the iteration carried out above, we know that the components of the stable orbit are.5649,.54666, and The unstable period 3 orbit then is {.6357,.524, and }. Let's start on this orbit and iterate, and see what happens.
19 map.nb 9 sol6 = iterate@8.6357<,.,, D 88.,.6357<, 8.,.524<, 82., <, 83.,.6357<, 84.,.524<, 85., <, 86.,.6357<, 87.,.5242<, 88., <, 89.,.6357<, 8.,.5242<, 8., <, 82.,.6357<, 83.,.5243<, 84., <, 85.,.63572<, 86.,.5245<, 87., <, 88.,.63573<, 89.,.5248<, 82., <, 82.,.63575<, 822.,.5243<, 823., <, 824.,.63578<, 825.,.5242<, 826.,.95529<, 827.,.63583<, 828.,.52435<, 829., <, 83.,.63592<, 83.,.52457<, 832., <, 833.,.6366<, 834.,.52493<, 835., <, 836.,.6363<, 837.,.52454<, 838., <, 839.,.63669<, 84., <, 84., <, 842.,.63734<, 843., <, 844.,.95525<, 845.,.63844<, 846.,.52476<, 847.,.95562<, 848.,.6429<, 849.,.52582<, 85.,.9557<, 85.,.64346<, 852., <, 853.,.9549<, 854.,.6494<, 855.,.52743<, 856.,.95468<, 857.,.65925<, 858.,.5349<, 859.,.95442<, 86.,.6793<, 86.,.53565<, 862., <, 863.,.72368<, 864., <, 865., <, 866.,.84467<, 867.,.5768<, 868., <, 869., 3859<, 87.,.68226<, 87.,.8346<, 872.,.53925<, 873.,.956<, 874.,.764<, 875., <, 876.,.9453<, 877.,.9836<, 878.,.68273<, 879.,.926<, 88.,.35483<, 88.,.82584<, 882., <, 883.,.9394<, 884., 46233<, 885.,.7858<, 886.,.78725<, 887.,.64554<, 888.,.88756<, 889., 2246<, 89.,.929<, 89., 78987<, 892.,.7747<, 893.,.67743<, 894., <, 895., <, 896., <, 897.,.62773<, 898.,.52944<, 899., <, 8.,.6237<< Although it isn't very strongly unstable, we can see that it is drifting off the orbit. Here's a longer run. sol7 = iterate@8.6357<,.,, D; last < Thus after a steps starting on the unstable period 3 orbit, we end up on the stable period 3 orbit. ü Hénon Map The Hénon map is a two-dimensional map developed by Michel Hénon to study chaos and strange attractors ("A Two-Dimensional Mapping with a Strange Attractor," Commun. Math. Phys. 5, 69, 976). It is discussed in many books on dynamical systems -- for eample in section 2.2 of Nonlinear Dynamics and Chaos by Steven Strogatz, Addison-Wesley, 994. The Hénon mapping provides a computationally straightforward way to study the compleities of chaos. The mapping has two parameters a and b. It is given by We define the system for DynPac. n+ = y n + - a n 2, y n+ = b n. setstate@8, y<d; setparm@8a, b<d; sysname = "Henon"; setmap; slopevec = 8y + - a 2,b<; parmval = 8.4,.3<;
20 map.nb 2 sysreport SYSTEM DEFINITION H.67L System name sysname = Henon State vector statevec = 8, y< State units stateunits = 8, < Slope vector slopevec = 8 - a * ^2 + y, b * < Parameter vector parmvec = 8a, b< Parameter values parmval = 8.4,.3< Parameter units vector parmunits = 8, < Time unit timeunit = System Type = mapping These parameter values were found by Hénon to produce a chaotic attractor. We begin by calculating the Jacobian of the map. jacob -b jacobval -.3 Thus the map will be dissipative (giving contracting areas in phase space) when»b» <. We construct a very lengthy iteration -- 5 points. We throw away the first points. One reason for calculating so many points is that we plan to zoom in on the structure of the attractor produced. Notice how much quicker this is than solving a differential equation for the same number of time steps. solhen = iterate@8, <,., 5, D; We use staterange to determine a suitable plotting window. staterange@solhend 88, , 449.<, , 299.<<, 8y, , 449.<, , 292.<<< plrange = 88-.5,.5<, 8-.5,.5<<; aon = False; frameon = True; asprat =.7;
21 map.nb 2 hengraph = phaser@solhend; Henon 8a, b<=8.4,.3< y This graph shows the chaotic attractor for the map. There is an incredible fine structure which does not show up on this scale. We zoom in by choosing a plotting window near the point {.5, }. In this zoom process, we follow closely the presentation in Strogatz' book of Hénon's work. We define a graphics zoombo that will put a bo on a graph to show the window used in the following graph. zoombo@rng_d := Graphics@ 8GrayLevel@.7D, Rectangle@First@rngD, Last@rngDD<, DisplayFunction -> IdentityD
22 map.nb , <<D, hengraphd; Henon 8a, b<=8.4,.3< The grey rectangle is the entire window for the net zoomed graph. plrange = 88.54,.7<, 8.5, <<;
23 map.nb 23 hengraph2 = phaser@solhend; Henon 8a, b<=8.4,.3<.9 y We zoom in once again show@zoombo@88.62,.85<, 8.64,.9<<D, hengraph2d; Henon 8a, b<=8.4,.3<
24 map.nb 24 Once again, the grey rectangle is the window for the net (and last) plot. plrange = 88.62,.64<, 8.85,.9<<; phaser@solhend;.9 Henon 8a, b<=8.4,.3<.9.89 y The unfolding of structure is amazing. In each case what appears to be three lines, becomes, when viewed more closesly, a set of 6 lines, grouped as three, two and one. The fractal nature of the attractor is such that this unfolding continues forever. Of course whether or not we see it in our graphs depends on how many iterates we have calculated. With our 5 points we can't go much further than we have here. We can eplore the sensitive dependence on initial position by looking at two orbits starting close together. We use red and blue for the orbit colors, and we carry out the construction using the function portraitmap. W throw away the first iterations. setcolor@8red, Blue<D; ptsize =.8; plrange = 88-.5,.5<, 8-.5,.5<<;
25 map.nb 25 <, 8.,.<<,.,,,, 2D; Henon 8a, b<=8.4,.3< y We can see from the colors that both orbits are spread over the attractor. We can also see the sensitive dependence from a time plot. plrange = 88, 5<, 8-.52,.52<<; solt = iterate@8, <,., 5, D; solt2 = iterate@8.,.<,., 5, D; pointcon = True;
26 map.nb 26 solt2<, D;.5 Henon 8a, b<=8.4,.3< t plrange = 88-.5,.5<, 8-.5,.5<<; pointcon = False; It is of interest to see how the iterates of the Hénon map depend on the parameter a. We leave b fied and vary a through 5 values, constructing a phase plot for each value. We accomplish this in an automated way by using the function bifurcmap[intlist,t,niter,ntoss,i,j,parmlist,ncomp]. The argument intlist is the list of initial conditions to be used in each graph. In this case, we use only one initial condition. The initial time is t and the number of interations is niter, with ntoss being thrown away first. The components i and j are to be plotted. The list of parameter values to be used is in parmlist. The final argument ncomp is optional. It is the level of function composition to be used with the basic map, and the default is. parmlist = 88,.3<, 8.6,.3<, 8.8,.3<, 8.,.3<, 8.2,.3<, 8.4,.3<<; ptsize =.8; setcolor@8black<d; bifurcmap@88, <<,.,,,, 2, parmlistd; Bifurcation sequence for parmlist = 88,.3<, 8.6,.3<, 8.8,.3<, 8.,.3<, 8.2,.3<, 8.4,.3<<
27 map.nb 27 Henon 8a, b<=8,.3< y Henon 8a, b<=8.6,.3< y
28 map.nb 28 Henon 8a, b<=8.8,.3< y Henon 8a, b<=8.,.3< y
29 map.nb 29 Henon 8a, b<=8.2,.3< y Henon 8a, b<=8.4,.3< y An interesting sequence. Looks like stable period two orbits for a =,.6, and.8, followed by a period four orbit for a =., and then chaotic orbits for a =.2 and.4. Let's look in more detail at the period four orbit. parmval = 8.,.3<;
30 map.nb 3 henfour = iterate@8, <,., 2, 2D 882., , <, 82.,.95695, <, 822., , 8558<, 823.,.27498, <, 824., , <, 825.,.95695, <, 826., , 8558<, 827.,.27498, <, 828., , <, 829.,.95695, <, 82., , 8558<, 82.,.27498, <, 822., , <, 823.,.95695, <, 824., , 8558<, 825.,.27498, <, 826., , <, 827.,.95695, <, 828., , 8558<, 829.,.27498, <, 822., , << Clearly period 4, as DynPac also tells us: periodmap@henfourd Solution is periodic; period = 4 We name the four points of the orbit. pt = Drop@First@henfourD, D , < pt2 = Drop@henfour@@2DD, D , < pt3 = Drop@henfour@@3DD, D , 8558< pt4 = Drop@henfour@@4DD, D , < We check by hand the orbit. mapval@ptd , < mapval@pt2d , 8558< mapval@pt3d , < mapval@pt4d , < From the calculation above, It is clear that the orbit is stable, but we check one point on it anyway. classifymap@pt, 4D strictly stable
31 map.nb 3 eigvalmap@pt, 4D , < eigsysmap@pt, 4D , <, , <, , <<< From what we have found, it appears that the Hénon map goes through a period-doubling sequence to chaos. We construct a view of this with a bifurcation diagram, varying a from to.4, and plotting versus a. We throw away the first 3 points and then plot 2, for each of 2 values of the parameter. asprat =.7; ptsize =.2; setcolor@8blue<d; biouthen = bimap@2, 3, 2,, 8-.5,.5<, 8, <, a, 8,.4<D; a 2 + y, b < a This diagram suggests lots of other things to eplore later, but we leave it for now. One final point on the Hénon map. Not all of the solutions are bounded. For some initial conditions and some parameter values, the iterates run off to infinity. We eplore this briefly. parmval = 8.7,.3<;
32 map.nb 32 <,., 2, D 88.,, <, 8.,.3,.3<, 82.,.47,.9<, 83., ,.344<, 84., , <, 85., , -6787<, 86., , -7725<, 87.,.78777, <, 88., -.637, 34233<, 89.,.2279, -.834<, 8., ,.36837<, 8., , <, 82., , <, 83., , <, 84., , <, 85., µ, -55.3<, 86., µ 2, µ <, 87., µ 43, µ 2 <, 88., µ 87, µ 42 <, 89., µ 74, µ 86 <, 82., µ 348, µ 73 << This is clearly heading for an overflow! To prevent overflows and possible crashes, we can use range checking, in which we specify a bo (named ranger) to contain the solution. The iteration is stopped as soon as the solution leaves the bo. To turn on range checking, we set rangeflag = True. rangeflag = True; ranger = 88-, <, 8-, <<; iterate@8, <,., 2, D 88.,, <, 8.,.3,.3<, 82.,.47,.9<, 83., ,.344<, 84., , <, 85., , -6787<, 86., , -7725<, 87.,.78777, <, 88., -.637, 34233<, 89.,.2279, -.834<, 8., ,.36837<, 8., , <, 82., , <, 83., , << We see that the iteration was stopped when a solution point first left the bo. The last point inside the bo is stored in the variable outbound. outbound 884., , << rangeflag = False; ü A Three-Dimensional Map Most published work on iterated maps deals with one- and two-dimensional maps. Such maps can ehibit the full range of compleities, unlike the situation with sets of autonomous differential equations where dimension three is the minimum dimension for chaos. All of this is by way of saying that there is no natural or well-studied eample to use here. In order to illustrate some of the 3D plotting features for maps, we define a somewhat artificial 3D map consisting of the logistic map in one dimension and the Hénon map in the other two. The mapping is defined by We define this system for Dynpac. n+ = y n + - a n 2, y n+ = b n, z n+ =rz n ( - z n ). setstate@8, y, z<d; setparm@8a, b, r<d; sysname = "Hybrid"; parmval = 8.8,.3, 2.8<; slopevec = 8y + - a 2, b, r zh - zl<; setmap;
33 map.nb 33 sysreport SYSTEM DEFINITION H.67L System name sysname = Hybrid State vector statevec = 8, y, z< State units stateunits = 8,,< Slope vector slopevec = 8 - a * ^2 + y, b *, r * H - zl * z< Parameter vector parmvec = 8a, b, r< Parameter values parmval = 8.8,.3, 2.8< Parameter units vector parmunits = 8,,< Time unit timeunit = System Type = mapping On the basis of work done earlier, we epect for the present parameter values to get an orbit of period 2, in which z is stationary. Let's try it.
34 map.nb 34 solhy = iterate@8,,.5<,., 75, D 88.,,,.5<, 8.,,,.7<, 82.,,.3,.588<, 83.,.268,.6,.67837<, 84., ,.384,.6969<, 85.,.33945, ,.66552<, 86., , 834, <, 87.,.9929, -.595,.65744<, 88., , ,.63595<, 89.,.2872, , <, 8., -568,.3867,.635<, 8.,.24792, , <, 82., , , <, 83.,.26455, -.56, <, 84., , ,.63973<, 85.,.25742, -.725, <, 86., , ,.6485<, 87.,.2648, -.465, <, 88., ,.37843,.64574<, 89.,.2596, , <, 82., , ,.64237<, 82.,.25973, ,.6435<, 822., ,.37799, <, 823.,.25949, , <, 824., , ,.64252<, 825.,.25959, ,.64325<, 826., , , <, 827.,.25955, ,.64329<, 828., , ,.64272<, 829.,.25957, , <, 83., ,.37787, <, 83.,.25956, -.537, <, 832., , ,.6428<, 833.,.25956, ,.64292<, 834., , ,.64282<, 835.,.25956, , <, 836., , , <, 837.,.25956, , <, 838., , , <, 839.,.25956, , <, 84., , , <, 84.,.25956, , <, 842., , ,.64285<, 843.,.25956, , <, 844., , , <, 845.,.25956, ,.64286<, 846., , , <, 847.,.25956, , <, 848., , , <, 849.,.25956, , <, 85., , , <, 85.,.25956, , <, 852., , , <, 853.,.25956, , <, 854., , , <, 855.,.25956, , <, 856., , , <, 857.,.25956, , <, 858., , , <, 859.,.25956, , <, 86., , , <, 86.,.25956, , <, 862., , , <, 863.,.25956, , <, 864., , , <, 865.,.25956, , <, 866., , , <, 867.,.25956, , <, 868., , , <, 869.,.25956, , <, 87., , , <, 87.,.25956, , <, 872., , , <, 873.,.25956, , <, 874., , , <, 875.,.25956, , << periodmap@solhyd Solution contains a periodic orbit; period = 2 Let's plot the approach to this in 3D. plotreset; pointcon = False; borat = 8,, <; ptsize =.; plrange3d = 88-.5,.5<, 8-.5,.5<, 8, <<;
35 map.nb 35 Hybrid 8a, b, r<=8.8,.3, 2.8<.8 z y A projection on the y plane: frameon = True; asprat = ; aon = False;
36 map.nb 36 2D; Hybrid 8a, b, r<=8.8,.3, 2.8<.3 y To get the pure orbit, we iterate again, this time throwing away the first iterates. solhy2 = iterate@8,,.5<,., 2, D; periodmap@solhy2d Solution is periodic; period = 2
37 map.nb 37 2D; Hybrid 8a, b, r<=8.8,.3, 2.8<.3 y We see the two points of the orbit in diagonally opposite corners. Now we try a portrait in 3D with several different initial conditions. We also change a so that the Hénon map is chaotic. parmval = 8.4,.3, 2.8<; plotreset; ptsize =.8; pointcon = False; borat = 8,, <; setcolor@8red, Blue<D; plrange3d = 88-.5,.5<, 8-.5,.5<, 8, <<;
38 map.nb 38 8.,.,.5<<,.,,,, 2, 3D; Hybrid 8a, b, r<=8.4,.3, 2.8<.8 z y Finally we will do a short bifurcation sequence, letting both r and a vary, using the command bifurc3dmap. setback@wheatd; parmlist = 88.,.3, 2.8<, 8.2,.3, 3.5<, 8.4,.3, 3.7<<; bifurc3dmap@88,, 3<, 8.,., 5<<,., 2, 2,, 2, 3, parmlistd; Bifurcation sequence for parmlist = 88.,.3, 2.8<, 8.2,.3, 3.5<, 8.4,.3, 3.7<<
39 map.nb 39 Hybrid 8a, b, r<=8.,.3, 2.8<.8 z y
40 map.nb 4 Hybrid 8a, b, r<=8.2,.3, 3.5<.8 z y
41 map.nb 4 Hybrid 8a, b, r<=8.4,.3, 3.7<.8 z y This last graph shows a kind of double chaos, and perhaps that is as good a place to quit as any.
ME 406 Further Results for the Project: Analysis of Solution Near the Spiral Equilibrium for a = 0
ME 406 Further Results for the Project: Analysis of Solution Near the Spiral Equilibrium for a = 0 1. Introduction sysid; plotreset; intreset; imsize = 250; Mathematica 6.0.3, DynPac 11.02, 4ê10ê2009 In
More informationME 406 Example of Stable and Unstable Manifolds
ME 46 Eample of Stable and Unstable Manifolds intreset; plotreset; ssid Mathematica 4..2, DnPac.66, 3ê8ê22 Introduction In this notebook, we stud an eample given in Differential Equations and Dnamical
More informationME 406 Trapping a Limit Cycle
orbtrap.nb 1 ME 406 Trapping a Limit Cycle sysid Mathematica 6.0.3, DynPac 11.01, 1ê13ê2009 intreset; plotreset; imsize = 250; ü Introduction In this notebook, we localize a limit cycle by orbit trapping.
More informationME 406 Predator-Prey Example Part 1 - Equilibrium
predpt1.nb 1 In[299]:= sysid Mathematica 6.0.3, DynPac 11.02, 2ê12ê2009 ME 406 Predator-Prey Example Part 1 - Equilibrium ü Introduction This is a simple model of an ecological system with three components:
More informationME 406 Bifurcations VII Subcritical Hopf Bifurcation
ME 406 Bifurcations VII Subcritical Hopf Bifurcation sysid Mathematica 4.1.2, DynPac 10.66, 3ê5ê2002 intreset; plotreset; 1. Introduction In this notebook, the seventh in a series of notebooks on bifurcations,
More informationME 406 Assignment 6 Solutions
ME 406 Assignment 6 Solutions sysid Mathematica 6.0.3, DynPac 11.02, 3ê12ê2009 inreset; plotreset; Problem 1 ü Part a We look for equilibria. The first equation requires y = 0, and the second equation
More informationME 163 A Catalogue of Equilibria for Systems of Two Linear Autonomous First Order Equations
catalogued.nb 1 ME 163 A Catalogue of Equilibria for Sstems of Two Linear Autonomous First Order Equations Introduction In this notebook, we look at solutions of equations of the following form: d = a
More informationME 406 S-I-R Model of Epidemics Part 2 Vital Dynamics Included
ME 406 S-I-R Model of Epidemics Part 2 Vital Dynamics Included sysid Mathematica 6.0.3, DynPac 11.01, 1ê13ê9 1. Introduction Description of the Model In this notebook, we include births and deaths in the
More informationME 406 Orbital Stability
ME 406 Orbital Stability sysid Mathematica 4.., DynPac 0.66, 3êê00. Introduction In this notebook we develop some examples which illustrate the concept of orbital stability. We begin by reviewing the "standard"
More informationME 406 Assignment #9 Solutions
ME 06 Assignment #9 Solutions sysid Mathematica 6.0., DynPac.0, ê8ê009 intreset; plotreset; imsize = 50; Problem The equations are x = -x, y = x +y, z = x + z. Let F = x + y +z. To show that the surface
More informationME 406 Trapping a Limit Cycle
orbtrap.nb 1 ME 6 Trapping a Limit Ccle In[3]:= ssid Mathematica.1, DnPac 1.65, ê13ê In[33]:= In[3]:= intreset; plotreset; ü Introduction In this notebook, we localize a limit ccle b orbit trapping. The
More informationxt+1 = 1 ax 2 t + y t y t+1 = bx t (1)
Exercise 2.2: Hénon map In Numerical study of quadratic area-preserving mappings (Commun. Math. Phys. 50, 69-77, 1976), the French astronomer Michel Hénon proposed the following map as a model of the Poincaré
More informationDynamical Systems. 1.0 Ordinary Differential Equations. 2.0 Dynamical Systems
. Ordinary Differential Equations. An ordinary differential equation (ODE, for short) is an equation involves a dependent variable and its derivatives with respect to an independent variable. When we speak
More informationCOSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics
COSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics Jorge Cortés and William B. Dunbar June 3, 25 Abstract In this and the coming lecture, we will introduce
More informationInfinity Unit 2: Chaos! Dynamical Systems
Infinity Unit 2: Chaos! Dynamical Systems Iterating Linear Functions These questions are about iterating f(x) = mx + b. Seed: x 1. Orbit: x 1, x 2, x 3, For each question, give examples and a symbolic
More informationv n+1 = v T + (v 0 - v T )exp(-[n +1]/ N )
Notes on Dynamical Systems (continued) 2. Maps The surprisingly complicated behavior of the physical pendulum, and many other physical systems as well, can be more readily understood by examining their
More informationWhy are Discrete Maps Sufficient?
Why are Discrete Maps Sufficient? Why do dynamical systems specialists study maps of the form x n+ 1 = f ( xn), (time is discrete) when much of the world around us evolves continuously, and is thus well
More informationIntroduction to Dynamical Systems Basic Concepts of Dynamics
Introduction to Dynamical Systems Basic Concepts of Dynamics A dynamical system: Has a notion of state, which contains all the information upon which the dynamical system acts. A simple set of deterministic
More informationMATH 415, WEEKS 14 & 15: 1 Recurrence Relations / Difference Equations
MATH 415, WEEKS 14 & 15: Recurrence Relations / Difference Equations 1 Recurrence Relations / Difference Equations In many applications, the systems are updated in discrete jumps rather than continuous
More informationOne dimensional Maps
Chapter 4 One dimensional Maps The ordinary differential equation studied in chapters 1-3 provide a close link to actual physical systems it is easy to believe these equations provide at least an approximate
More informationMath 1314 Lesson 4 Limits
Math 1314 Lesson 4 Limits What is calculus? Calculus is the study of change, particularly, how things change over time. It gives us a framework for measuring change using some fairly simple models. In
More informationNonlinear Dynamics. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna.
Nonlinear Dynamics Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna http://www.moreno.marzolla.name/ 2 Introduction: Dynamics of Simple Maps 3 Dynamical systems A dynamical
More informationA summary of factoring methods
Roberto s Notes on Prerequisites for Calculus Chapter 1: Algebra Section 1 A summary of factoring methods What you need to know already: Basic algebra notation and facts. What you can learn here: What
More informationChaos and Liapunov exponents
PHYS347 INTRODUCTION TO NONLINEAR PHYSICS - 2/22 Chaos and Liapunov exponents Definition of chaos In the lectures we followed Strogatz and defined chaos as aperiodic long-term behaviour in a deterministic
More informationONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS
Journal of Pure and Applied Mathematics: Advances and Applications Volume 0 Number 0 Pages 69-0 ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS HENA RANI BISWAS Department of Mathematics University of Barisal
More informationDynamical Systems with Applications
Stephen Lynch Dynamical Systems with Applications using MATLAB Birkhauser Boston Basel Berlin Preface xi 0 A Tutorial Introduction to MATLAB and the Symbolic Math Toolbox 1 0.1 Tutorial One: The Basics
More informationvii Contents 7.5 Mathematica Commands in Text Format 7.6 Exercises
Preface 0. A Tutorial Introduction to Mathematica 0.1 A Quick Tour of Mathematica 0.2 Tutorial 1: The Basics (One Hour) 0.3 Tutorial 2: Plots and Differential Equations (One Hour) 0.4 Mathematica Programs
More information4452 Mathematical Modeling Lecture 13: Chaos and Fractals
Math Modeling Lecture 13: Chaos and Fractals Page 1 442 Mathematical Modeling Lecture 13: Chaos and Fractals Introduction In our tetbook, the discussion on chaos and fractals covers less than 2 pages.
More informationINFINITE SUMS. In this chapter, let s take that power to infinity! And it will be equally natural and straightforward.
EXPLODING DOTS CHAPTER 7 INFINITE SUMS In the previous chapter we played with the machine and saw the power of that machine to make advanced school algebra so natural and straightforward. In this chapter,
More informationME DYNAMICAL SYSTEMS SPRING SEMESTER 2009
ME 406 - DYNAMICAL SYSTEMS SPRING SEMESTER 2009 INSTRUCTOR Alfred Clark, Jr., Hopeman 329, x54078; E-mail: clark@me.rochester.edu Office Hours: M T W Th F 1600 1800. COURSE TIME AND PLACE T Th 1400 1515
More information8 Autonomous first order ODE
8 Autonomous first order ODE There are different ways to approach differential equations. Prior to this lecture we mostly dealt with analytical methods, i.e., with methods that require a formula as a final
More informationNonlinear Oscillations and Chaos
CHAPTER 4 Nonlinear Oscillations and Chaos 4-. l l = l + d s d d l l = l + d m θ m (a) (b) (c) The unetended length of each spring is, as shown in (a). In order to attach the mass m, each spring must be
More informationFinding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients. Takayuki Yamaguchi
Hokkaido Mathematical Journal Vol. 44 (2015) p. 277 312 Finding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients Takayuki Yamaguchi (Received March 13,
More informationBasic methods to solve equations
Roberto s Notes on Prerequisites for Calculus Chapter 1: Algebra Section 1 Basic methods to solve equations What you need to know already: How to factor an algebraic epression. What you can learn here:
More informationDynamical Systems with Applications using Mathematica
Stephen Lynch Dynamical Systems with Applications using Mathematica Birkhäuser Boston Basel Berlin Contents Preface xi 0 A Tutorial Introduction to Mathematica 1 0.1 A Quick Tour of Mathematica 2 0.2 Tutorial
More informationNewton's method for complex polynomials
Newton's method for complex polynomials A preprint version of a Mathematical graphics column from Mathematica in Education and Research. Mark McClure mcmcclure@unca.edu Department of Mathematics University
More informationAPPLICATIONS OF DIFFERENTIATION
4 APPLICATIONS OF DIFFERENTIATION APPLICATIONS OF DIFFERENTIATION The method we used to sketch curves in Section 4.5 was a culmination of much of our study of differential calculus. The graph was the final
More informationMath Problem Set #3 Solution 19 February 2001
Math 203-04 Problem Set #3 Solution 19 February 2001 Exercises: 1. B & D, Section 2.3, problem #3. In your answer, give both exact values and decimal approximations for the amount of salt in the tank at
More informationPH 120 Project # 2: Pendulum and chaos
PH 120 Project # 2: Pendulum and chaos Due: Friday, January 16, 2004 In PH109, you studied a simple pendulum, which is an effectively massless rod of length l that is fixed at one end with a small mass
More informationChaos in the Hénon-Heiles system
Chaos in the Hénon-Heiles system University of Karlstad Christian Emanuelsson Analytical Mechanics FYGC04 Abstract This paper briefly describes how the Hénon-Helies system exhibits chaos. First some subjects
More informationA MINIMAL 2-D QUADRATIC MAP WITH QUASI-PERIODIC ROUTE TO CHAOS
International Journal of Bifurcation and Chaos, Vol. 18, No. 5 (2008) 1567 1577 c World Scientific Publishing Company A MINIMAL 2-D QUADRATIC MAP WITH QUASI-PERIODIC ROUTE TO CHAOS ZERAOULIA ELHADJ Department
More informationTWO DIMENSIONAL FLOWS. Lecture 5: Limit Cycles and Bifurcations
TWO DIMENSIONAL FLOWS Lecture 5: Limit Cycles and Bifurcations 5. Limit cycles A limit cycle is an isolated closed trajectory [ isolated means that neighbouring trajectories are not closed] Fig. 5.1.1
More informationLecture 10: Powers of Matrices, Difference Equations
Lecture 10: Powers of Matrices, Difference Equations Difference Equations A difference equation, also sometimes called a recurrence equation is an equation that defines a sequence recursively, i.e. each
More informationTHE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES
THE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES DAN-ADRIAN GERMAN Department of Computer Science, Indiana University, 150 S Woodlawn Ave, Bloomington, IN 47405-7104, USA E-mail: dgerman@csindianaedu
More informationAre numerical studies of long term dynamics conclusive: the case of the Hénon map
Journal of Physics: Conference Series PAPER OPEN ACCESS Are numerical studies of long term dynamics conclusive: the case of the Hénon map To cite this article: Zbigniew Galias 2016 J. Phys.: Conf. Ser.
More informationMITOCW ocw f99-lec23_300k
MITOCW ocw-18.06-f99-lec23_300k -- and lift-off on differential equations. So, this section is about how to solve a system of first order, first derivative, constant coefficient linear equations. And if
More informationChapter 5: Limits, Continuity, and Differentiability
Chapter 5: Limits, Continuity, and Differentiability 63 Chapter 5 Overview: Limits, Continuity and Differentiability Derivatives and Integrals are the core practical aspects of Calculus. They were the
More informationMaps and differential equations
Maps and differential equations Marc R. Roussel November 8, 2005 Maps are algebraic rules for computing the next state of dynamical systems in discrete time. Differential equations and maps have a number
More information4.5 Rational functions.
4.5 Rational functions. We have studied graphs of polynomials and we understand the graphical significance of the zeros of the polynomial and their multiplicities. Now we are ready to etend these eplorations
More informationUniversity of Colorado at Colorado Springs Math 090 Fundamentals of College Algebra
University of Colorado at Colorado Springs Math 090 Fundamentals of College Algebra Table of Contents Chapter The Algebra of Polynomials Chapter Factoring 7 Chapter 3 Fractions Chapter 4 Eponents and Radicals
More informationDynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325
Dynamical Systems and Chaos Part I: Theoretical Techniques Lecture 4: Discrete systems + Chaos Ilya Potapov Mathematics Department, TUT Room TD325 Discrete maps x n+1 = f(x n ) Discrete time steps. x 0
More informationLesson 10: Polynomials
Lesson 10: Polynomials restart; When Newton is slow We saw that when the equation has a solution p with, Newton's method converges very quickly (for an appropriate starting point), because. When, on the
More informationThe connected locus for complex cubic iteration
The connected locus for complex cubic iteration A preprint version of a Mathematical graphics column from Mathematica in Education and Research. Mark McClure Department of Mathematics University of North
More informationMITOCW ocw-18_02-f07-lec02_220k
MITOCW ocw-18_02-f07-lec02_220k The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for free.
More informationTHREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations
THREE DIMENSIONAL SYSTEMS Lecture 6: The Lorenz Equations 6. The Lorenz (1963) Equations The Lorenz equations were originally derived by Saltzman (1962) as a minimalist model of thermal convection in a
More informationTHE SEPARATRIX FOR A SECOND ORDER ORDINARY DIFFERENTIAL EQUATION OR A 2 2 SYSTEM OF FIRST ORDER ODE WHICH ALLOWS A PHASE PLANE QUANTITATIVE ANALYSIS
THE SEPARATRIX FOR A SECOND ORDER ORDINARY DIFFERENTIAL EQUATION OR A SYSTEM OF FIRST ORDER ODE WHICH ALLOWS A PHASE PLANE QUANTITATIVE ANALYSIS Maria P. Skhosana and Stephan V. Joubert, Tshwane University
More informationAlgebra Exam. Solutions and Grading Guide
Algebra Exam Solutions and Grading Guide You should use this grading guide to carefully grade your own exam, trying to be as objective as possible about what score the TAs would give your responses. Full
More informationCHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS
CHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS The chief aim of this chapter is to discuss the dynamical behaviour of some 1-dimensional discrete maps. In this chapter, we
More informationLab 5: Nonlinear Systems
Lab 5: Nonlinear Systems Goals In this lab you will use the pplane6 program to study two nonlinear systems by direct numerical simulation. The first model, from population biology, displays interesting
More informationTHE SIMPLE PROOF OF GOLDBACH'S CONJECTURE. by Miles Mathis
THE SIMPLE PROOF OF GOLDBACH'S CONJECTURE by Miles Mathis miles@mileswmathis.com Abstract Here I solve Goldbach's Conjecture by the simplest method possible. I do this by first calculating probabilites
More informationMathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers
Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called
More informationA New Chaotic Behavior from Lorenz and Rossler Systems and Its Electronic Circuit Implementation
Circuits and Systems,,, -5 doi:.46/cs..5 Published Online April (http://www.scirp.org/journal/cs) A New Chaotic Behavior from Lorenz and Rossler Systems and Its Electronic Circuit Implementation Abstract
More informationExtracting beauty from chaos
1997 2004, Millennium Mathematics Project, University of Cambridge. Permission is granted to print and copy this page on paper for non commercial use. For other uses, including electronic redistribution,
More informationSimple conservative, autonomous, second-order chaotic complex variable systems.
Simple conservative, autonomous, second-order chaotic complex variable systems. Delmar Marshall 1 (Physics Department, Amrita Vishwa Vidyapeetham, Clappana P.O., Kollam, Kerala 690-525, India) and J. C.
More informationCOUNCIL ROCK HIGH SCHOOL MATHEMATICS. A Note Guideline of Algebraic Concepts. Designed to assist students in A Summer Review of Algebra
COUNCIL ROCK HIGH SCHOOL MATHEMATICS A Note Guideline of Algebraic Concepts Designed to assist students in A Summer Review of Algebra [A teacher prepared compilation of the 7 Algebraic concepts deemed
More information2 Discrete growth models, logistic map (Murray, Chapter 2)
2 Discrete growth models, logistic map (Murray, Chapter 2) As argued in Lecture 1 the population of non-overlapping generations can be modelled as a discrete dynamical system. This is an example of an
More informationFundamentals of Dynamical Systems / Discrete-Time Models. Dr. Dylan McNamara people.uncw.edu/ mcnamarad
Fundamentals of Dynamical Systems / Discrete-Time Models Dr. Dylan McNamara people.uncw.edu/ mcnamarad Dynamical systems theory Considers how systems autonomously change along time Ranges from Newtonian
More informationChapter 9: Roots and Irrational Numbers
Chapter 9: Roots and Irrational Numbers Index: A: Square Roots B: Irrational Numbers C: Square Root Functions & Shifting D: Finding Zeros by Completing the Square E: The Quadratic Formula F: Quadratic
More informationLesson 4: Non-fading Memory Nonlinearities
Lesson 4: Non-fading Memory Nonlinearities Nonlinear Signal Processing SS 2017 Christian Knoll Signal Processing and Speech Communication Laboratory Graz University of Technology June 22, 2017 NLSP SS
More informationSlope Fields: Graphing Solutions Without the Solutions
8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,
More informationMITOCW ocw f99-lec17_300k
MITOCW ocw-18.06-f99-lec17_300k OK, here's the last lecture in the chapter on orthogonality. So we met orthogonal vectors, two vectors, we met orthogonal subspaces, like the row space and null space. Now
More informationMAT335H1F Lec0101 Burbulla
Fall 2012 4.1 Graphical Analysis 4.2 Orbit Analysis Functional Iteration If F : R R, then we shall write F 2 (x) = (F F )(x) = F (F (x)) F 3 (x) = (F F 2 )(x) = F (F 2 (x)) = F (F (F (x))) F n (x) = (F
More informationTWELVE LIMIT CYCLES IN A CUBIC ORDER PLANAR SYSTEM WITH Z 2 -SYMMETRY. P. Yu 1,2 and M. Han 1
COMMUNICATIONS ON Website: http://aimsciences.org PURE AND APPLIED ANALYSIS Volume 3, Number 3, September 2004 pp. 515 526 TWELVE LIMIT CYCLES IN A CUBIC ORDER PLANAR SYSTEM WITH Z 2 -SYMMETRY P. Yu 1,2
More informationLECTURE 8: DYNAMICAL SYSTEMS 7
15-382 COLLECTIVE INTELLIGENCE S18 LECTURE 8: DYNAMICAL SYSTEMS 7 INSTRUCTOR: GIANNI A. DI CARO GEOMETRIES IN THE PHASE SPACE Damped pendulum One cp in the region between two separatrix Separatrix Basin
More informationHÉNON HEILES HAMILTONIAN CHAOS IN 2 D
ABSTRACT HÉNON HEILES HAMILTONIAN CHAOS IN D MODELING CHAOS & COMPLEXITY 008 YOUVAL DAR PHYSICS DAR@PHYSICS.UCDAVIS.EDU Chaos in two degrees of freedom, demonstrated b using the Hénon Heiles Hamiltonian
More informationProblem Set Number 2, j/2.036j MIT (Fall 2014)
Problem Set Number 2, 18.385j/2.036j MIT (Fall 2014) Rodolfo R. Rosales (MIT, Math. Dept.,Cambridge, MA 02139) Due Mon., September 29, 2014. 1 Inverse function problem #01. Statement: Inverse function
More informationSolutions for the Practice Final - Math 23B, 2016
olutions for the Practice Final - Math B, 6 a. True. The area of a surface is given by the expression d, and since we have a parametrization φ x, y x, y, f x, y with φ, this expands as d T x T y da xy
More informationCHAOS/FRACTAL
CHAOS/FRACTAL 8 6.8.6 4.4. 4 5..4.6.8.4 8...8 6.8.6 - - 4.6.4.4 -.. - -6-5 -4 - - -..95.955.96.965.97.975.98..4.6.8 Presentation in Dynamical System. By Fred Khoury Introduction This paper is divided into
More informationMITOCW ocw f99-lec09_300k
MITOCW ocw-18.06-f99-lec09_300k OK, this is linear algebra lecture nine. And this is a key lecture, this is where we get these ideas of linear independence, when a bunch of vectors are independent -- or
More informationSECTION 4-3 Approximating Real Zeros of Polynomials Polynomial and Rational Functions
Polynomial and Rational Functions 79. P() 9 9 8. P() 6 6 8 7 8 8. The solutions to the equation are all the cube roots of. (A) How many cube roots of are there? (B) is obviously a cube root of ; find all
More informationPractice problems for Exam 3 A =
Practice problems for Exam 3. Let A = 2 (a) Determine whether A is diagonalizable. If so, find a matrix S such that S AS is diagonal. If not, explain why not. (b) What are the eigenvalues of A? Is A diagonalizable?
More informationUnit Ten Summary Introduction to Dynamical Systems and Chaos
Unit Ten Summary Introduction to Dynamical Systems Dynamical Systems A dynamical system is a system that evolves in time according to a well-defined, unchanging rule. The study of dynamical systems is
More informationSection 3.3 Graphs of Polynomial Functions
3.3 Graphs of Polynomial Functions 179 Section 3.3 Graphs of Polynomial Functions In the previous section we eplored the short run behavior of quadratics, a special case of polynomials. In this section
More informationChapter 1: January 26 January 30
Chapter : January 26 January 30 Section.7: Inequalities As a diagnostic quiz, I want you to go through the first ten problems of the Chapter Test on page 32. These will test your knowledge of Sections.
More informationNIT #7 CORE ALGE COMMON IALS
UN NIT #7 ANSWER KEY POLYNOMIALS Lesson #1 Introduction too Polynomials Lesson # Multiplying Polynomials Lesson # Factoring Polynomials Lesson # Factoring Based on Conjugate Pairs Lesson #5 Factoring Trinomials
More informationComputer Problems for Taylor Series and Series Convergence
Computer Problems for Taylor Series and Series Convergence The two problems below are a set; the first should be done without a computer and the second is a computer-based follow up. 1. The drawing below
More information56 CHAPTER 3. POLYNOMIAL FUNCTIONS
56 CHAPTER 3. POLYNOMIAL FUNCTIONS Chapter 4 Rational functions and inequalities 4.1 Rational functions Textbook section 4.7 4.1.1 Basic rational functions and asymptotes As a first step towards understanding
More informationModeling Prey and Predator Populations
Modeling Prey and Predator Populations Alison Pool and Lydia Silva December 15, 2006 Abstract In this document, we will explore the modeling of two populations based on their relation to one another. Specifically
More informationHomework 2 Modeling complex systems, Stability analysis, Discrete-time dynamical systems, Deterministic chaos
Homework 2 Modeling complex systems, Stability analysis, Discrete-time dynamical systems, Deterministic chaos (Max useful score: 100 - Available points: 125) 15-382: Collective Intelligence (Spring 2018)
More informationThe logistic difference equation and the route to chaotic behaviour
The logistic difference equation and the route to chaotic behaviour Level 1 module in Modelling course in population and evolutionary biology (701-1418-00) Module author: Sebastian Bonhoeffer Course director:
More informationNonlinear dynamics & chaos BECS
Nonlinear dynamics & chaos BECS-114.7151 Phase portraits Focus: nonlinear systems in two dimensions General form of a vector field on the phase plane: Vector notation: Phase portraits Solution x(t) describes
More informationExercise 4 (unit 2): a =1.5; b =0.1; f = H1+aLx bx^2d; x, 8D, 8x, 0, 30<, PlotRange 810, 18<D. "D.
Exercise 4 (unit 2): 4. Consider the function fhxl of Exercise 3 for a=1.5 and b=0.1. Plot the eigth iterate of f. Which is the attracting fixed point of f? What can you guess about its attraction basin?
More informationReconstruction Deconstruction:
Reconstruction Deconstruction: A Brief History of Building Models of Nonlinear Dynamical Systems Jim Crutchfield Center for Computational Science & Engineering Physics Department University of California,
More informationAPPLICATIONS OF DIFFERENTIATION
4 APPLICATIONS OF DIFFERENTIATION APPLICATIONS OF DIFFERENTIATION 4.8 Newton s Method In this section, we will learn: How to solve high degree equations using Newton s method. INTRODUCTION Suppose that
More informationMAT335H1F Lec0101 Burbulla
Fall 2011 Q 2 (x) = x 2 2 Q 2 has two repelling fixed points, p = 1 and p + = 2. Moreover, if I = [ p +, p + ] = [ 2, 2], it is easy to check that p I and Q 2 : I I. So for any seed x 0 I, the orbit of
More informationAlgebra Review C H A P T E R. To solve an algebraic equation with one variable, find the value of the unknown variable.
C H A P T E R 6 Algebra Review This chapter reviews key skills and concepts of algebra that you need to know for the SAT. Throughout the chapter are sample questions in the style of SAT questions. Each
More informationSTANDARDS OF LEARNING CONTENT REVIEW NOTES. ALGEBRA I Part II 1 st Nine Weeks,
STANDARDS OF LEARNING CONTENT REVIEW NOTES ALGEBRA I Part II 1 st Nine Weeks, 2016-2017 OVERVIEW Algebra I Content Review Notes are designed by the High School Mathematics Steering Committee as a resource
More informationDynamical Systems: Lecture 1 Naima Hammoud
Dynamical Systems: Lecture 1 Naima Hammoud Feb 21, 2017 What is dynamics? Dynamics is the study of systems that evolve in time What is dynamics? Dynamics is the study of systems that evolve in time a system
More informationFINAL PROJECT TOPICS MATH 399, SPRING αx 0 x < α(1 x)
FINAL PROJECT TOPICS MATH 399, SPRING 2011 MARIUS IONESCU If you pick any of the following topics feel free to discuss with me if you need any further background that we did not discuss in class. 1. Iterations
More informationStructure of Materials Prof. Anandh Subramaniam Department of Material Science and Engineering Indian Institute of Technology, Kanpur
Structure of Materials Prof. Anandh Subramaniam Department of Material Science and Engineering Indian Institute of Technology, Kanpur Lecture - 5 Geometry of Crystals: Symmetry, Lattices The next question
More information