ENGG2013 Unit 16 Tipping point Mar, 2011.. Content How to cut a pizza Population growth model – Rabbit – Fish – Fish with harvesting kshumENGG20132.

Slides:



Advertisements
Similar presentations
5.4 Correlation and Best-Fitting Lines
Advertisements

Section 9.1 – Sequences.
4.5 Graphing Linear Equations
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
ENGG2013 Unit 1 Overview Jan, Course info Textbook: “Advanced Engineering Mathematics” 9 th edition, by Erwin Kreyszig. Lecturer: Kenneth Shum.
ENGG2013 Unit 17 Diagonalization Eigenvector and eigenvalue Mar, 2011.
1 Section 6.1 Recurrence Relations. 2 Recursive definition of a sequence Specify one or more initial terms Specify rule for obtaining subsequent terms.
ENGG2013 Unit 18 The characteristic polynomial Mar, 2011.
Graphing Linear Equations in Two Variables The Graph of a linear equation in two variables is the graph of all the ordered pairs (x,y) that satisfy the.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Arithmetic Sequences and Series
2-1 Arithmetic Sequences Definitions & Equations Writing & Solving Arithmetic Sequences Practice Problems.
Arithmetic Sequences A sequence in which each term after the first is obtained by adding a fixed number to the previous term is an arithmetic sequence.
6-1 Solving Systems by Graphing
Arithmetic Sequences (Recursive Formulas). Vocabulary sequence – a set of numbers in a specific order. terms – the numbers in the sequence. arithmetic.
Section 7.2 Arithmetic Sequences Arithmetic Sequence Finding the nth term of an Arithmetic Sequence.
At the beginning, there was a couple of rabbits (one male and one female) in the farm.
Chapter 8. Section 8. 1 Section Summary Introduction Modeling with Recurrence Relations Fibonacci Numbers The Tower of Hanoi Counting Problems Algorithms.
GEOMETRIC PROPERTIES OF LINEAR FUNCTIONS 2.
What are two types of Sequences?
Recurrence Relation. Outline  What is a recurrence relation ?  Solving linear recurrence relations  Divide-and-conquer algorithms and recurrence relations.
CSE 2813 Discrete Structures Recurrence Relations Section 6.1.
Language Goal  Students will be able to verbally express direct variation. Math Goal  Students will be able to identify, write, and graph direct variation.
Recurrence Relation Models
Section 7.5: The Logistic Equation Practice HW from Stewart Textbook (not to hand in) p. 542 # 1-13 odd.
Unit 1 Functions and Graphs 1.1: Modeling and Equation Solving Focus: Factor completely. = ( ) 2 – ( ) 2 5r4 What goes here? = ( + )( – ) 44 5r = ( ) 2.
In this lesson you will learn another way to define a sequence — by a recursive rule. So far you have worked with explicit rules for the n th term of a.
COMMON CORE STANDARDS for MATHEMATICS FUNCTIONS: INTERPRETING FUNCTIONS (F-IF) F-IF3. Recognize that sequences are functions, sometimes defined recursively.
Generating Functions and Counting Trees. Today’s Plan 1.Generating functions for basic sequences 2.Operations on generating functions 3.Counting 4.Solve.
Leonardo Pisano Fibonacci
Arithmetic Sequences as Linear Functions
POPULATION  an entire group of people or objects that you want information about. Sample  the part of the group that is surveyed. This is not new – we.
Growth by a percentage (on each time step) Recursive (One-step) Formulas a n+1 = a n +.05 * a n (open to other scenarios) a n+1 = 1.05 * a n (can implement.
7.2 Solving Linear Recurrence Relations Some of these recurrence relations can be solved using iteration or some other ad hoc technique. However, one important.
Introduction A sequence is an ordered list of numbers. The numbers, or terms, in the ordered list are determined by a formula that is a function of the.
2.5 CORRELATION AND BEST-FITTING LINES. IN THIS LESSON YOU WILL : Use a scatter plot to identify the correlation shown by a set of data. Approximate the.
Agenda Lecture Content:  Recurrence Relations  Solving Recurrence Relations  Iteration  Linear homogenous recurrence relation of order k with constant.
Infinite Geometric Series Recursion & Special Sequences Definitions & Equations Writing & Solving Geometric Series Practice Problems.
Computational Biology, Part 14 Recursion Relations Robert F. Murphy Copyright  1996, 1999, 2000, All rights reserved.
Identify Linear Functions & Their Graphs Honors Math – Grade 8.
RECURRENCE Sequence Recursively defined sequence
Essential Questions Introduction to Sequences
Graphing Linear Equations In Standard Form Ax + By = C.
Warm Up Write down objective and homework in agenda Lay out homework (None) Homework (Recursive worksheet) Get a Calculator!!!
Recursive Series and Summations. Finding the general term of a sequence can be difficult. You are looking for a pattern and then giving it a mathematical.
4.1 Exponential Functions I can write an exponential equation from an application problem I can use an exponential equation to solve a problem.
1 RECURRENCE 1. Sequence 2. Recursively defined sequence 3. Finding an explicit formula for recurrence relation.
Advanced Algorithms Analysis and Design
Unit 9: Sequences and Series. Sequences A sequence is a list of #s in a particular order If the sequence of numbers does not end, then it is called an.
L OGISTIC E QUATIONS Sect. 8-6 continued. Logistic Equations Exponential growth (or decay) is modeled by In many situations population growth levels off.
8.1 – Sequences and Series. Sequences Infinite sequence = a function whose domain is the set of positive integers a 1, a 2, …, a n are the terms of the.
Announcements Topics: -Introduction to (review of) Differential Equations (Chapter 6) -Euler’s Method for Solving DEs (introduced in 6.1) -Analysis of.
“Toy” Model: Fibonacci The Fibonacci sequence first appears in the book Liber Abaci (1202) by Leonardo of Pisa, known as Fibonacci.
What comes next? Arithmetic Sequences. Write the next two terms in the sequence….. 7, 13, 19, 25, ___, ___ 3137.
Fibonacci’s rabbits Fibonacci posed the following problem:
3.5 Recurrence Relations.
Introduction to Recurrence Relations
Standard Form I can identify intercepts from an equation.
Objectives Find the nth term of a sequence. Write rules for sequences.
Linear Functions SOL 8.14, SOL 8.16, SOL 8.17.
Exponential Functions and Graphs
Graphing Linear Equations
What is the x-intercept?
Chapter 3 Section 1 Systems of Linear Equations in Two Variables All graphs need to be done on graph paper. Four, five squares to the inch is the best.
The nth term, Un Example If we are given a formula for Un (th nth term) where find the first five terms of the sequence Un = 3n + 1.
Recurrence Relations Discrete Structures.
Write the recursive and explicit formula for the following sequence
Graphing Linear Equations
Does each term increase/decrease by the same added amount each time?
Presentation transcript:

ENGG2013 Unit 16 Tipping point Mar, 2011.

Content How to cut a pizza Population growth model – Rabbit – Fish – Fish with harvesting kshumENGG20132

HOW TO CUT A PIZZA? kshumENGG20133

Pizza Cutting What is the maximal number of pieces you can get by cutting a pizza n times? kshumENGG20134 One cut: 2 pieces two cuts: 4 pieces

How many pieces for 3 cuts? kshumENGG20135 Three cuts: 7 pieces

How many pieces for 4 cuts? kshumENGG20136 Four cuts: 11 pieces

How many pieces for 5 cuts? kshumENGG20137 Five cuts: 16 pieces

Is there any pattern? Let P(n) be the maximal number of pieces you can get by n cuts. P(1) = 2, P(2) = 4, P(3) = 7, P(4) = 11, P(5) = 16 kshumENGG20138 A recursive formula: P(n) = P(n–1)+n

COUNTING RABBITS kshumENGG20139

A Population Growth Model for Rabbits Model – One pair of baby rabbits, one male and one female at the beginning. – Baby rabbit becomes adult rabbit after one month. – Each pair of adult rabbits produces one male and one female baby rabbit in each month. Q: How many pairs of rabbits after n months? kshumENGG

A Recursion Formula Let F(n) be the number of pairs of rabbits in the n-th period of time F(1) = 1, F(2) = 1, F(3) = 2, F(3) = 3, F(4) = 5 kshumENGG F(n) = F(n-1) + F(n-2) This sequence of integers are called the Fibonacci numbersFibonacci numbers

A Puzzle kshumENGG x8=64 5x13 = 65

LOGISTIC POPULATION GROWTH MODEL kshumENGG201313

Logistic population growth – n(t) = population of fish in a lake in the t-th year – t = 0,1,2,3,4 kshumENGG Increase in population Proportionality constant An example for K=1 Graph of n(1-n) Slow growth fast growth Slow growth negative growth

Example Take a=0.5, K = 1 for example kshumENGG Matlab program: T = 20; n = zeros(1,T); % Initialize n to the zero vector n(1) = 0.7; % Initial population for t = 2:T n(t) = n(t-1)+0.5*n(t-1)*(1-n(t-1)); end plot(1:T,n,'ro-') xlabel('time') ylabel('Population')

Fish Population with harvesting Population growth with harvesting kshumENGG Matlab program: T = 20; n = zeros(1,T); % Initialize n to the zero vector n(1) = 0.7; % Initial population for t = 2:T n(t) = max(n(t-1)+0.5*n(t-1)*(1-n(t-1)) - 0.1,0); end plot(1:T,n,'ro-') xlabel('time') ylabel('Population')

Tipping point ( 臨界點 ) If h < 0.125, stable population If h > 0.125, fish will disappear eventually kshumENGG h=0.12 h=0.13 Below the tipping pointAbove the tipping point

Tipping point Compare the different effects on the fish population – if we harvest h=0.124 per year – If we harvest h=0.126 per year Plots of the fish population for 150 years: kshumENGG h=0.124 h=0.126 Slightly below the tipping pointSlightly above the tipping point

Tipping point kshumENGG h=0.1249h= Marginally below the tipping pointMarginally above the tipping point Compare the different effects on the fish population – if we harvest h= per year – If we harvest h= per year Plots of the fish population for 500 years:

Discussion A system may depend on some external parameters which we may choose. – The amount of harvest per year in the previous example. There may be a sudden change in system behavior by modifying a parameter slightly. Cannot cross the tipping point if we want a sustainable environment. kshumENGG201320

Discrete-time dynamical system How to solve? – Given some initial condition, find how the system evolve. How to solve linear difference equation in general? – Pizza cut, and Fibonacci numbers satisfies some linear difference equations – How to compute F(1000)? The logistic growth model (with or without harvesting) is not linear. kshumENGG201321