CHAOS Lucy Calvillo Michael Dinse John Donich Elizabeth Gutierrez Maria Uribe.

Slides:



Advertisements
Similar presentations
Arc-length computation and arc-length parameterization
Advertisements

Boyce/DiPrima 9th ed, Ch 2.8: The Existence and Uniqueness Theorem Elementary Differential Equations and Boundary Value Problems, 9th edition, by William.
Lecture 5 Newton-Raphson Method
Technique of nondimensionalization Aim: –To remove physical dimensions –To reduce the number of parameters –To balance or distinguish different terms in.
Section 7.2: Direction Fields and Euler’s Methods Practice HW from Stewart Textbook (not to hand in) p. 511 # 1-13, odd.
Coursework Requirements Numerical Methods. 1.Front Cover indicating that the coursework is about the numerical Solution of Equations. Include your name,
2. Numerical differentiation. Approximate a derivative of a given function. Approximate a derivative of a function defined by discrete data at the discrete.
Welcome To Math 463: Introduction to Mathematical Biology
Logistic Map. Discrete Map  A map f is defined on a metric space X.  Repeated application of f forms a sequence. Discrete set of points  A sequence.
Discrete-Time Models Lecture 1. Discrete models or difference equations are used to describe biological phenomena or events for which it is natural to.
1 6.3 Separation of Variables and the Logistic Equation Objective: Solve differential equations that can be solved by separation of variables.
NUMERICAL METHODS WITH C++ PROGRAMMING
MST: Red Rule, Blue Rule. 2 MST Instance
Continuous Models Chapter 4. Bacteria Growth-Revisited Consider bacteria growing in a nutrient rich medium Variables –Time, t –N(t) = bacteria density.
Numerical Methods for Partial Differential Equations CAAM 452 Spring 2005 Lecture 9 Instructor: Tim Warburton.
DEPARTMENT OF MATHEMATI CS [ YEAR OF ESTABLISHMENT – 1997 ] DEPARTMENT OF MATHEMATICS, CVRCE.
A Numerical Technique for Building a Solution to a DE or system of DE’s.
§12.5 The Fundamental Theorem of Calculus
Scientific Computation Using Excel 1. Introduction Scientific computing is very important for solving real world application problems. Population predictions,
Solving Systems of Equations. Rule of Thumb: More equations than unknowns  system is unlikely to have a solution. Same number of equations as unknowns.
Chaos Identification For the driven, damped pendulum, we found chaos for some values of the parameters (the driving torque F) & not for others. Similarly,
4 Copyright © Cengage Learning. All rights reserved. Applications of Differentiation.
Population Modeling Mathematical Biology Lecture 2 James A. Glazier (Partially Based on Brittain Chapter 1)
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Lecture Notes Dr. Rakhmad Arief Siregar Universiti Malaysia Perlis
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Newton's Method for Functions of Several Variables Joe Castle & Megan Grywalski.
TEST 1 REVIEW. Single Species Discrete Equations Chapter 1 in Text, Lecture 1 and 2 Notes –Homogeneous (Bacteria growth), Inhomogeneous (Breathing model)
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 5a.
Math 3120 Differential Equations with Boundary Value Problems
Ch 9.8: Chaos and Strange Attractors: The Lorenz Equations
Warm Up 10/3/13 1) The graph of the derivative of f, f ’, is given. Which of the following statements is true about f? (A) f is decreasing for -1 < x
Copyright © Cengage Learning. All rights reserved. Applications of Differentiation.
1 Complex Images k’k’ k”k” k0k0 -k0-k0 branch cut   k 0 pole C1C1 C0C0 from the Sommerfeld identity, the complex exponentials must be a function.
Georgia Performance Standard (GPS): MM4A1 “Students Will Explore Rational Functions.”
Numerical Methods for Engineering MECN 3500
Numerical Methods.
CHAPTER 3 NUMERICAL METHODS
Motivation As we’ve seen, chaos in nonlinear oscillator systems, such as the driven damped pendulum discussed last time is very complicated! –The nonlinear.
Dr. Jie Zou PHY Chapter 2 Solution of Nonlinear Equations: Lecture (II)
Approximate Current on a Wire – A Differential Equation Method Adam Schreiber, Yuriy Goykhman, Chalmers Butler.
Simple nonlinear systems. Nonlinear growth of bugs and the logistic map x i+1 =μx i (1-x i )
Copyright © Cengage Learning. All rights reserved. 4 Applications of Differentiation.
4 Numerical Methods Root Finding.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Do Now: #18 and 20 on p.466 Find the interval of convergence and the function of x represented by the given geometric series. This series will only converge.
“Cobweb” diagrams. Affine Difference Equations---Slope bigger than 1.
8.7 Exponential Functions. Goals / “I can….” Evaluate exponential functions Graph exponential functions 8.7 – Exponential Functions.
Lesson 54 - FTC PART 2 Calculus - Santowski 7/6/2016Calculus - Santowski1.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Solving Systems of Equations. Rule of Thumb: More equations than unknowns  system is unlikely to have a solution. Same number of equations as unknowns.
MATH 1910 Chapter 3 Section 5 Limits at Infinity.
Copyright © Cengage Learning. All rights reserved.
Local Linearity and Approximation
Solution of Equations by Iteration
Copyright © Cengage Learning. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Further Sequences and Series
POLYNOMIAL INTERPOLATION
Objectives Determine (finite) limits at infinity.
Lecture 21: B Spline Curve
Section 5.1 Inverse Functions
컴퓨터 그래픽스를 위한 기하학적 기초 (Line Geometry for Computer Graphics)
Which equation does the function {image} satisfy ?
Population Modeling Mathematical Biology Lecture 2 James A. Glazier
Fixed- Point Iteration
CHAPTER 5: Exponential and Logarithmic Functions
Copyright © Cengage Learning. All rights reserved.
1 Newton’s Method.
2.2 Fixed-Point Iteration
Presentation transcript:

CHAOS Lucy Calvillo Michael Dinse John Donich Elizabeth Gutierrez Maria Uribe

Problem Statement Consider the function: f(x)=ax(1-x) on the interval [0,1] where a is a real number 1 < a < 5 This function is also known as the logistic function.

Logistic Function and the unrestricted growth function The model for unrestricted growth is very simple:f(x) = ax For an example using flies this means that in each generation there will be a times as many flies as in the previous generation.

Logistic Function and the restricted growth function In 1845 P.F Verhulst derived a model of restricted growth. The model is derived by supposing the factor a decreases as the number x increases. The biggest population that the environment will support is x=1. For our example if there are x insects then 1-x is a measure of the space nature permits for population growth. Consequently replacing a by a(1-x) transforms the model to:f(x) = ax(1- x) which is the initial equation we were given.

Problem Statement Compute the fixed points for the function: f(x)=ax(1-x) on the interval [0,1] where a is a real number 1 < a < 5

Fixed Points A fixed point is a point which does not change upon application of a map, system of differential equations, etc. The fixed points can be obtained graphically as the points of intersection of the curve f(x) and the line y = x. The fixed points of the logistic function are 0 and (a -1) / a.

Problem Statement Compute the first twenty values of the sequence given by: x n+1 = f(x n ) Using the starting values of x 0 =0.3 x 0 =0.6 x 0 =0.9 For a= 1.5, 2.1, 2.8, 3.1 & 3.6

Iterations Iteration: making repititions, iterations are functions that are repeated. For instance the first iteration yields: x n+1 = f(x n )f(x) = ax (1-x) x 1 = f(0.3) x 1 = (1.5)(0.3)(1-0.3) x 1 = Iterations allowed us to compare the convergence behavior.

a= 1.5x 0 =

a= 1.5x 0 =

a = 1.5x 0 =

a = 2.1x 0 =

a = 2.1x 0 =

a = 2.1x 0 =

a = 2.8x 0 =

a = 2.8x 0 =

a = 2.8x 0 =

a = 3.1x 0 =

a = 3.1x 0 =

a = 3.1x 0 =

a = 3.6x 0 =

a = 3.6x 0 =

a = 3.6x 0 =

Problem Statement Compute f’(x) and explain the behavior

By evaluating the derivative at the fixed point (x*) it can be determined Where f ’(x*) = m, for m < -1, the iterative path is repelled and spirals away from fixed point -1 < m, the iterative path is attracted and spirals into the fixed point 0 < m <1, the iterative path is attracted and staircases into the fixed point m >1, the iterative path is repelled and staircases away f(x) = ax(1-x) f(x) = ax - ax 2 f ’(x) = a - 2ax f ’(x) = a (1 - 2x)

Problem Statement Consider g(x) = f(f(x)) and compute all fixed points.

g(x) = f(f(x)) f(x)=ax - ax 2 f(f(x))=a(ax - ax 2 ) - a(ax - ax 2 ) 2 g(x) = f(f(x)) g(x) = a(ax - ax 2 ) - a(ax - ax 2 ) 2 The fixed points of the function are: 0 (a - 1) / a 1/2 + 1/2a + 1/2a (a 2 - 2a - 3) 0.5 The first two fixed points are the same as those computed for the general logistic function. The two new fixed points are the numerical values of the orbit of convergence.

Problem Statement Investigate the sequence x n+1 = g(x n ) for the values of: Using the starting values of x 0 =0.3 x 0 =0.6 x 0 =0.9 For a= 1.5, 2.1, 2.8, 3.1 & 3.6

a= 1.5x 0 =

a= 1.5x 0 =

a = 1.5x 0 =

a = 2.1x 0 =

a = 2.1x 0 =

a = 2.1x 0 =

a = 2.8x 0 =

a = 2.8x 0 =

a = 2.8x 0 =

a = 3.1x 0 =

a = 3.1x 0 =

a = 3.1x 0 =

a = 3.6x 0 =

a = 3.6x 0 =

a = 3.6x 0 =

Conclusions

Work Cited knot.com/blue/chaos.shtml