CHAOS/FRACTAL

Similar documents
Julia Sets and the Mandelbrot Set

Fractal Geometry Time Escape Algorithms and Fractal Dimension

Fractals and Dimension

Fractals. R. J. Renka 11/14/2016. Department of Computer Science & Engineering University of North Texas. R. J. Renka Fractals

NOTES ON BARNSLEY FERN

Zoology of Fatou sets

FINAL PROJECT TOPICS MATH 399, SPRING αx 0 x < α(1 x)

Chapter 8. Fractals. 8.1 Introduction

2 Problem Set 2 Graphical Analysis

Fractals. Krzysztof Gdawiec.

COSMOS: Making Robots and Making Robots Intelligent Lecture 3: Introduction to discrete-time dynamics

4 Problem Set 4 Bifurcations

PHY411 Lecture notes Part 4

UNIVERSITY OF TORONTO Faculty of Arts and Science DECEMBER 2011 EXAMINATIONS. MAT335H1F Solutions Chaos, Fractals and Dynamics Examiner: D.

Fractals. Part 6 : Julia and Mandelbrot sets, Martin Samuelčík Department of Applied Informatics

Analytic Continuation of Analytic (Fractal) Functions

More Details Fixed point of mapping is point that maps into itself, i.e., x n+1 = x n.

MATH 614 Dynamical Systems and Chaos Lecture 2: Periodic points. Hyperbolicity.

Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II.

xt+1 = 1 ax 2 t + y t y t+1 = bx t (1)

Infinity Unit 2: Chaos! Dynamical Systems

Complicated dynamics from simple functions

Julia Sets Converging to the Filled Basilica

Introduction to Chaotic Dynamics and Fractals

Bifurcations in the Quadratic Map

MS 3011 Exercises. December 11, 2013

2 Discrete growth models, logistic map (Murray, Chapter 2)

The Mandelbrot Set and the Farey Tree

MAT335H1F Lec0101 Burbulla

ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS

Take a line segment of length one unit and divide it into N equal old length. Take a square (dimension 2) of area one square unit and divide

Department of Computer Sciences Graphics Fall 2005 (Lecture 8) Fractals

GRE Math Subject Test #5 Solutions.

Edward Lorenz. Professor of Meteorology at the Massachusetts Institute of Technology

Fractals and Chaos - opt Practical Problems

One Dimensional Dynamical Systems

Chapter 3. Gumowski-Mira Map. 3.1 Introduction

Topic 4 Notes Jeremy Orloff

If one wants to study iterations of functions or mappings,

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS

Hysteresis. Lab 6. Recall that any ordinary differential equation can be written as a first order system of ODEs,

vii Contents 7.5 Mathematica Commands in Text Format 7.6 Exercises

e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form

Examensarbete. Fractals and Computer Graphics. Meritxell Joanpere Salvadó

Unit Ten Summary Introduction to Dynamical Systems and Chaos

CMSC 425: Lecture 12 Procedural Generation: Fractals

arxiv: v1 [math.ds] 17 Mar 2010

*P46958A0244* IAL PAPER JANUARY 2016 DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA. 1. f(x) = (3 2x) 4, x 3 2

August 16, Alice in Stretch & SqueezeLand: 15 Knife Map. Chapter Summary-01. Overview-01. Overview-02. Rossler-01. Rossler-02.

CMSC 425: Lecture 11 Procedural Generation: Fractals and L-Systems

Derivatives and Continuity

Visualizing complex analytic functions using domain coloring

Lecture2 The implicit function theorem. Bifurcations.

The Order in Chaos. Jeremy Batterson. May 13, 2013

Personal notes on renormalization

Metric Spaces and Topology

Math 106 Fall 2014 Exam 2.1 October 31, ln(x) x 3 dx = 1. 2 x 2 ln(x) + = 1 2 x 2 ln(x) + 1. = 1 2 x 2 ln(x) 1 4 x 2 + C

Mid Term-1 : Solutions to practice problems

Chaos. Lendert Gelens. KU Leuven - Vrije Universiteit Brussel Nonlinear dynamics course - VUB

Classification of Phase Portraits at Equilibria for u (t) = f( u(t))

Chaos Theory. Namit Anand Y Integrated M.Sc.( ) Under the guidance of. Prof. S.C. Phatak. Center for Excellence in Basic Sciences

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.

10/22/16. 1 Math HL - Santowski SKILLS REVIEW. Lesson 15 Graphs of Rational Functions. Lesson Objectives. (A) Rational Functions

Non Locally-Connected Julia Sets constructed by iterated tuning

Dynamical Systems with Applications using Mathematica

The Schwarzian Derivative

Fractals and iteration function systems II Complex systems simulation

Een vlinder in de wiskunde: over chaos en structuur

One dimensional Maps

MATH 614 Dynamical Systems and Chaos Lecture 3: Classification of fixed points.

LECTURE-13 : GENERALIZED CAUCHY S THEOREM

MORE EXERCISES FOR SECTIONS II.1 AND II.2. There are drawings on the next two pages to accompany the starred ( ) exercises.

Self-Referentiality, Fractels, and Applications

2 Metric Spaces Definitions Exotic Examples... 3

Lecture3 The logistic family.

AN INTRODUCTION TO FRACTALS AND COMPLEXITY

McGill University Math 354: Honors Analysis 3

Fractals and Chaos - opt Practical Problems

Dynamical Systems with Applications

An Introduction to Self Similar Structures

Dynamical Systems: Lecture 1 Naima Hammoud

Polynomial and Rational Functions. Chapter 3

Precalculus Notes: Functions. Skill: Solve problems using the algebra of functions.

Topic 1 Part 3 [483 marks]

11 Chaos in Continuous Dynamical Systems.

ADDITIONAL MATHEMATICS

The Hausdorff Measure of the Attractor of an Iterated Function System with Parameter

The topological differences between the Mandelbrot set and the tricorn

18.04 Practice problems exam 1, Spring 2018 Solutions

JULIA SETS AND BIFURCATION DIAGRAMS FOR EXPONENTIAL MAPS

Chapter 2. Polynomial and Rational Functions. 2.5 Zeros of Polynomial Functions

The dynamics of maps close to z 2 + c

TWO DIMENSIONAL FLOWS. Lecture 5: Limit Cycles and Bifurcations

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

DSP-I DSP-I DSP-I DSP-I

a factors The exponential 0 is a special case. If b is any nonzero real number, then

arxiv: v1 [math.ho] 1 Dec 2012

Vector Space and Linear Transform

THREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations

Functions, Graphs, Equations and Inequalities

Transcription:

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 three sections:. The behavior of the logistic and quadratic functions in real plane and real parameters. Then the behavior of the logistic function in complex orbit with real and complex parameters.. The fractal curve of COSINE function in complex number.. Generating trees, a Sierpinski triangle, and a Fern branch through Iterated Function System (I.F.S).

- Part A - Logistic Function: g (x) = x ( x) The fixed point(s) is/are when the function g (x) intersects with the bisector equation F(x) = x, where the parameter. That imply to g (x) = F(x) x ( x) = x -x (x +- ) = Example: =. The fixed points are: x =, and x = - - - - - - The stability of a fixed point is dependent on the nearby behavior that either converges to or diverges from the fixed points. [g (x)] = ( x) d - [g ()] = dx if > g () > ; then the fixed point x = is unstable if < if = dx d dx d dx d g() g() d dx < ; then the fixed point x = is stable =, the fixed point at x = is undetermined - The same analysis goes to x =

....4.5.5.4..5. - -.5.5 - - -. -.5 - - - - Graphical analysis =.5 and the starting point =., -.8, and. respectively Phase portrait of g (x) when < < If =, there is only one fixed point at x, =, where g (x) is neither attracting nor repelling..8.8.6.4.7.6.8..5.4.6 -.4 -...4.6.8..4 -. -.4.......4.5.6.7.8..4.6.8 Graphical analysis of g (x) when < <. Phase Portrait of g (x) when < <. Phase portrait of g (x) when =. But when >, the logistic function g (x) intersects the bisector function at x = and x =. [g dx d (x)] = ( x) = >. dx d g () Therefore the logistic function g (x) is unstable at x = for all >. g (x) is repelling from now as >.

.8.8.7.7.6.6.5.5.4.4...... Phase Portrait of g (x) when < <.....4.5.6.7.8....4.5.6.7.8 Graphical analysis of g (x) when < <. However, when < <, the iteration converges to g (x) = x ( x) ( - x + x ) = but by going in loop until it attracts it. So, for the roots to be real numbers: > < - and >. d dx g () = > the system is repelling at. But for =, the logistic becomes g (x) = x ( x) and the fixed points are and. As passes through, a single attracting fixed points becomes an attracting -cycle. Therefore, the derivative of g at the fixed point is equal to, indicating a period-doubling bifurcation at =.

.8.8.8.8.8.6.6.6.6.6.4.4.4.4.4.......4.6.8..4.6.8..4.6.8..4.6.8..4.6.8 =.. ( iterations).4.5.8 Phase Portrait of g (x) when.45 < < 4. For the third iteration: g (x) = x (-x)( - x + x )) ( - x + ( + )x - x 4 - x ). When >.4494..., the function with power degree of 8. Therefore, the dynamical behavior is a period-doubling bifurcation with period 4-orbit.

..4.6.8 pitchfork diagram. As we see, that every branch is splitting/divided into two branches or periodic orbits or cycles. The terminology of that, the fraction play a role by dividing every cycle into two separate cycles ( to to 4 to 8 to ½ n ) as shown above..8.8.8.8.6.6.6.6.4.4.4.4......4.6.8..4.6.8..4.6.8 = 4. 4. 4. Boundary of the dynamical behavior of logistic function. The word fractal from the Latin root fractus, suggesting fragment, broken and discontinuous. This word was described by Benoit Mandelbrot in 975 is: To describe shapes which are detailed at all scales.

Feigenbaum diagram.

Part B - The quadratic function: f (x) = x + The fixed points for the quadratic function f (x) are given by: f (x) = F(x) x + = x x x + =, where. The roots of the quadratic equation are: x, = 4 4 We can rewrite these fixed points in the form of: P+ =, and P- = 4 If ( - 4) < > ¼, then the fixed points are imaginary and since the fixed points are real..4.5.75.8.5..5.5.6.4.75.5 -.6 -.4 -...4 -. -.4 -.5 - -.5.5.5 -.5..5 - -.6..4.6.8.5.5.75.5.5.75 -.5 The second iteration of f (x) is: f (x) = (x + ) + Therefore f (x) equation has 4 roots. P -, P +, P - = ½ (- - 4 ), and P + = ½ (- + 4 ) ; which are periodic points of period for f (x).

d At P + and P - f (P ) dx = 4 ( + ) < is stable, - < 4 ( + ) < - < ( + ) < - < < - 5 4 4 Therefore for - < < - is stable and attracting with -cycle (periodic of -period orbits), or it is called period-doubling bifurcation; otherwise is unstable. 4 4 5 4 4.5.5.5.5 -.5 - -.5.5 -.5 - -.5.5 -.5 - -.5.5 -.5 -.5 -.5 -.5 - -.5.5 -.5 - - - - -.5 -.5 -.5 -.5 = -.8 (Starting point.5) -.8 (Starting point.) -. -.

.5.5 -.5 -.5 - - -. - -.8 -.6 -.4 -.75 -.5 -.5 -. -.75 -.5 -.5 -. (a) 4-cycles (b) more cycles Pitchfork bifurcation diagram of f (x).5 -.5 - -.5.5 -.5 - - - - - - - - - - -.5 - - - Graphical analysis of f (x) when = -.4, -., -.(5 iterations), -..

.5.5 -.5 - -.5 -.8 -.6 -.4 -. - -.8 -.6.5.5 -.84 -.8 -.78 -.76 -.74 -.7 -.7 -.5 - -.5 Feigenbaum diagram. When is closed to -.755, the dynamical behavior changes the period attractor to period, 5, 7, and so on (all exist), replacing the period of, 4, 8, 6,. That why, the period- attractor is causing that window to open in the bifurcation diagram.

Part- C. The logistic function f(z) = z ( z) Testing the behavior of a function and determining the birth of a fractal curve, is time-consuming. A quicker method for calculating points on the fractal curve is to use the inverse of the function. Any initial point chosen either from inside or outside of the curve will then converge to the points on the fractal curve..5.5 5-4 - 4 -.5 - -4-4 - -.5.5.5 -.5 - -.5.5.5 Plot for f(z) = z ( z). Therefore, the fixed points of f(z) are: z =, and z = The stability of this system depends on the value of. When is real, this behavior had been determined in the logistic function of the real function g (x) earlier.

Let determine the inverse function of f(z) such that: f(z) = z ( z) = z - z z - z + f = The roots of the second degree function of z are given: Therefore the inverse function can be obtained from the complex roots, thus the are two transformation functions is in the form of: C(z) or z = and z = f 4 4f/ - λ 4λ f λ λ z, z 4 z 4 For = ( ); the fixed point of f(z) are and. = = > ; then the system is unstable repelling at the origin. = - = ; then the system is undetermined at. Recall the logistic function, the bifurcation in the orbit behavior takes place near =. An attracting fixed point becomes a repelling fixed point and becomes an attracting -cycle (period- doubling bifurcation at = ). () f dz d ) ( f dz d Let apply the fixed points to the complex function C(z): C() = C( ) = ) ( 4 and ) ( 4

....75...5.5. -...4.6.8 -.5 -.5..4.6.8...4.6 -..5..5..5..5.4 -. -.75 -. -. -. C(z) = 4 z.5 The inverse function when = - zoom-in. cusp-like C( ) = 4.5 =, the system attracting near the fixed point. C( ) = 4.5. 5, the system is repelling periodic points near the fixed point.4.5. - -.5.5.5 -.5.5.5.75.5..4.6.8 - -.5 -..5..5 -.5 -. -.5 - - =.5...5..4.6.8.4. -. -.4.4. -. -.4..4.6.8 -.4..4.6.8 =.5.89 = 4.

For ; Let = + ai; where a. Let choose first the value for: a = = + i. The fixed points of the system for this parameter are: and 5 ( + i). When the inverse for this transformation is iterated, the interior points converge on the boundary of the set, and similarly the exterior points converge to the same set, unless otherwise already on the set. This set or boundary seems that it attracts the orbits of all points of the z plane..4.4.. -...4.6.8 -...4.6.8 -.4 -.4 These iterations have an absolute value of +. The set of Julia after -point: for = + i and - i.4.4.4.....4.6.8..4.6.8..4.6.8 -. -. -. -.4 -.4 -.4 = +.i +.8i +.i +.8i

For = + bi; where b..75.75.5.5.5.5.5.5 -.5.5.5.75.5 -.5 - -.5.5.5.75.5 -.5 - -.5.5.5.75.5 -.5 -.5 -.75 -.5.5.5.75.5 -.5 -.5 -.75 = +.i +.5i +.8i + i..75.5.5 -. -.5.5. -.5 -.5 The orbits of some starting points z in the z-plane tend toward the fixed point at infinity or toward the interior fixed point. When the inverse transformation of the logistic function is iterated, the interior points of the set converge on the Julia set boundary, and similarly the exterior points converge on the boundary.

- The fractal curve of Cosine function in complex number.

The behavior of the cosine function with a real value to iteration as the iteration increases (cos[cos[cos [x]..])..5-8 -6-4 - 4 -.5.7985.7985.7985.7985.7985.7985 - -6-4 - 4 6 (a) 5/ < x < / (b) 75 iteration.7985.7985.7985.7985.7985.7985.7985.7985.7985.7985.7985.7985.7985.7985-6 -4-4 6-6 -4-4 6-6 -4-4 6 (c) 9 (d) 9 (e) 94 (.79845 -.79855)

7.5 5.5 - - - - - - - - Plot for f(x) = cos(x) in -dimension and its contour. For the -iterations of the cosine function: cos(cos(x)) 8 6 4 75 5 5 - - - - - - -6-4 - 4 6

The behavior of the -iteration of cosine: cos(cos(cos(x))). 7.5 5.5 - - 7.5 5.5-5 - 5 8 6 4 - - - - - - -

For 4-iterations for the cosine function: cos[cos[cos[cos[x]]]] 5-5 - - 5 - - - - - This splitting creates the fractal bifurcation to become more visible to us. If we increase the iteration more (nest more cos function), the dynamical behavior splits each in half and so on, in type of (divide into n- ). The power (n-) is when the fractals start occurring, the contour shows the chaos is starting to build-up.

- - - - - - - - - - - - - - Cos[z] - - Cos[Cos[z]] - - - - Cos[Cos[Cos[z]]] - - - Cos[Cos[Cos[Cos[z]]]] Cos[ [Cos[z]..]

.8.6.4..5.5.5.4.5....8.5.6.4....95.955.96.965.97.975.98.5.96.965.96.965.96.965.964

8 6-8 6 4 4 5 Generating Trees, a Sierpinski Triangle, and a Fern branch through Iterated Function System (I.F.S) 4 4 5.8.6.4...4.6.8

An Iterated Function System (I.F.S): I.F.S specifies a discrete scattering dynamical system. An I.F.S consists of a set of contractive functions that define a more complex contractive function. For Example: w x y.75.75 x y.5 4 x y 4 Let T be the original tree, then T n = W (T n- ) is the tree after n th iterations. Therefore; N T n is a set of trees lined up in the following with N = 5. n.8.75x.5.75 y.8.6.6.4.4....4.6.8..4.6.8

The union of the tree can be determine in the following: N T n n N n - t n - t n x y t n.4.8.8..6.6..8.4.4.6...4...4.6.8..4.6.8.9.9.94.96.98

Part - B Sierpinski triangle In this part, the purpose is to create a Sierpinski triangle from a given triangle. 8 6 First we need to set the dimension and the coordinate values of the triangle and they are given by: T (,) = (,) T (5,) = (5,) T (,) = (,) 4 4 5 So we construct smaller copies of the axiom triangle with dimension of ½ of the entire triangle. T 4 = T 5 = T 6 =.5.5 x y x.5 y 5 x.5 y 5 8 6 4 4 5

8 8 8 6 6 6.6 4 4 4.5.4... 4 5 4 5 4 5.5..5..5..5 Sierpinski gasket There is a relation between the reduction factor r and the number of pieces t into which the structure can be divided. That it will end up t = rd The n-iteration t = n of side length r = r n, where r is the original length. Therefore the fractal dimension D of Sierpinski gasket, by using log, is: D = log t log r log log n n log(# of triangles) log(magnification) log log.58496

Then transpose the linear transformation of the Sierpinski triangle through a polynomial mapping P.Where the mapping is given by the function: x ax(x - b) P y y Mapping to a second-degree function: ax(x - b), and y is mapping to itself x y n n ax n - (x y n - n - - b) 8 8 8 8 6 6 6 6 4 4 4 4 4 5 6 4 5 4 5 6 --5--5 5 5 a = -5, b = 5 a = -, b = 5 a = -, b = 5 a = ; b = -5 8 8 8 8 6 6 6 6 4 4 4 4 5 5-468 a =, b =, 4, 5, 8-6 -5-4 - - - -5--5--5

Part C - FERN

A sequence of sets A n in that converges to a fern-like set through a proper I.F.S. 5 5 75 5 5 75 5 5 75 5 5 75 - - - 4 5 6 The matrices give the general equation for the system: f e y x d c b a y x F Can be reform or rewritten in a polar coordinate format, which is describing the affined transformation for I.F.S as follows: f e y x s.cos - r.sin s.sin r.cos y x F The I.F.S for the square in fig.-a is given by: 7 7 y x 6 6 y x F

x = 5 cos() = 49.9 x = 4.97, and y = 5 sin() =.6 y =.67 + ½ (.6) =.98 (x, y ) = (-4.97,.98), x = 4.97, y =.67 4.97 sin() =. (4.97,.7) x = x + 5 sin() = 7.6, y = y + 5 cos() = 5. (7.6, 5.) x = x - 5 cos() = -., y = y + 5 sin() = 5.85 (-., 5.85) F = (,), (,) F = (-4.97,.98), (4.97,.7), (7.6, 5.), (-., 5.85) F = (-6, -5.), (6, 8.5), (-9.6,.7), (-.6, 7.97) F 4 = (4.5, -7.6), (-4.5, 8.4), (.,.64), (., 7.4) Since the I.F.S used affine transformations, which produce the fern from contractions. The four equations F, F, F, and F 4 can be rewritten in other format (form contractions). Each transformation is of the form of matrices or vectors: F new = A F old + B where A (x) and B ((e, f) constant vector) are the matrices, F new is the new values for the system in I.F.S, and F old the domain of the mapping. Therefore, the contraction may be written in form: x y a x c x b y d y e f for x, and y 6.

The contraction for F is: - a e - c f 6 b 6 d and b, d a e c f 6.667 a c e f x y x x y.667 y The contraction for F : x y.8 x.4 x.45 y.8 y.67 F : y x. x. x -. y.6 y.67 F 4 : x y.5 x.6 x.8 y.4 y.44 The dimension D of the attractor A can be computed from the equation N.a D =. Where N is the number of the mapping of the square (N = 4), and a is the percentage of the 4 reduced replica by (a = ¾). Therefore; the selfsimilarity dimension D is: D logn log a log4 log /4 log4 log 4 4.88

6 75 5 5 5 4 75 5 5 5 5 75 5 5 75 - - -

Barnsley s fern after n-iterations This corner looks like the leaf, if only I squeeze it and distort it and turn it about. This piece is a distortion of the whole thing. Barnsley, Michael.

Special Thanks To: Dr. Shiau, Lie June. Jesse Warren.