ordinary differential equations i - computer...

Announce Introduction Initial Value Problems Theory Model Equations Simple Integration

Ordinary Differential Equations I

CS 205A:Mathematical Methods for Robotics, Vision, and Graphics

Doug James (and Justin Solomon)

CS 205A: Mathematical Methods Ordinary Differential Equations I 1 / 35

Announcements

Last Homework (HW7):I Due Tuesday 6/6 (before midnight)I NOTE: No late HW7 submissions accepted.

Final Exam:I Sat June 10 @ 3:30-6:30pm in (Room: NVIDIA

Auditorium)I Covers all material–emphasis on 2nd halfI Two cheatsheets–can reuse one from midtermI Similar format to midtermI OAE: Tentatively: 2:00pm start (pls confirm time)I SCPD: Arrange similar time (or slightly later date)

Theme of Last Few Weeks

The unknown is an entirefunction f .

New Twist

So far:f (or its derivative/integral) known

at isolated points

Instead:Optimize properties of f

New Twist

So far:f (or its derivative/integral) known

at isolated points

Instead:Optimize properties of f

Example Problems

I Approximate f0 with f but make it smoother

(or sharper!)

I Simulate some dynamical or physical

relationship as f (t) where t is time

I Approximate f0 with f but transfer

properties of g0

Example Problems

(or sharper!)

properties of g0

Example Problems

(or sharper!)

properties of g0

Today: Initial Value Problems

Find f (t) : R→ Rn

Satisfying F [t, f (t), f ′(t), f ′′(t), . . . , f (k)(t)] = 0

Given f (0), f ′(0), f ′′(0), . . . , f (k−1)(0)

Example of canonical form (on board):

y′′ = ty′ cos y

Today: Initial Value Problems

Find f (t) : R→ Rn

Satisfying F [t, f (t), f ′(t), f ′′(t), . . . , f (k)(t)] = 0

Given f (0), f ′(0), f ′′(0), . . . , f (k−1)(0)

Example of canonical form (on board):

y′′ = ty′ cos y

Most Famous Example

~F = m~aNewton’s second law

~F (t, ~x, ~x′) usual expression of force

n particles =⇒ simulation in R3n

Most Famous Example

Protein Folding

http://www.sciencedaily.com/releases/2012/11/121122152910.htm

Gradient Descent

min~xE(~x)

=⇒ ~xi+1 = ~xi − h∇E(~xi)

=⇒h→0

dt= −∇E(~x)

Gradient Descent

min~xE(~x)

=⇒ ~xi+1 = ~xi − h∇E(~xi)

=⇒h→0

dt= −∇E(~x)

Gradient Descent

min~xE(~x)

=⇒ ~xi+1 = ~xi − h∇E(~xi)

=⇒h→0

dt= −∇E(~x)

Crowd Simulation

http://video.wired.com/watch/building-a-better-zombie-wwz-exclusive

http://gamma.cs.unc.edu/DenseCrowds/

Examples of ODEs

I y′ = 1 + cos t: solved by integrating both sides

I y′ = ay: linear in y, no dependence on t

I y′ = ay + et: time and value-dependent

I y′′ + 3y′ − y = t: multiple derivatives of y

I y′′ sin y = ety′: nonlinear in y and t

Examples of ODEs

Reasonable Assumption

Explicit ODEAn ODE is explicit if can be written in the form

f (k)(t) = F [t, f (t), f ′(t), f ′′(t), . . . , f (k−1)(t)].

Otherwise need to do root-finding!

Reasonable Assumption

Explicit ODEAn ODE is explicit if can be written in the form

f (k)(t) = F [t, f (t), f ′(t), f ′′(t), . . . , f (k−1)(t)].

Otherwise need to do root-finding!

Reduction to First Order

f (k)(t) = F [t, f(t), f ′(t), f ′′(t), . . . , f (k−1)(t)]

f0(t)f1(t)

...fk−2(t)fk−1(t)

f1(t)f2(t)

...fk−1(t)

F [t, f0(t), f1(t), . . . , fk−1(t)]

Reduction to First Order

f (k)(t) = F [t, f(t), f ′(t), f ′′(t), . . . , f (k−1)(t)]

f0(t)f1(t)

...fk−2(t)fk−1(t)

f1(t)f2(t)

...fk−1(t)

F [t, f0(t), f1(t), . . . , fk−1(t)]

Example

y′′′ = 3y′′ − 2y′ + y

1 −2 3

Example

y′′′ = 3y′′ − 2y′ + y

1 −2 3

Time Dependence

Visualization: Slope field

Time Dependence

Visualization: Slope field

Autonomous ODE

~y′ = F [~y]

No dependence of F on t

g′(t) =

(f ′(t)

g′(t)

(F [f (t), g(t)]

Autonomous ODE

~y′ = F [~y]

No dependence of F on t

g′(t) =

(f ′(t)

g′(t)

(F [f (t), g(t)]

Visualization: Phase Space

θ′′ = − sin θCS 205A: Mathematical Methods Ordinary Differential Equations I 17 / 35

Visualization: Traces

x′ = σ(y − x), y′ = x(ρ− z)− y, z′ = xy − βz

Existence and Uniqueness

Two cases:y(0) = 0, y(0) 6= 0

Existence and Uniqueness

Theorem: Local existence and uniqueness

Suppose F is continuous and Lipschitz, that is,‖F [~y]− F [~x]‖2 ≤ L‖~y − ~x‖2 for some fixed L ≥ 0.Then, the ODE f ′(t) = F [f(t)] admits exactly onesolution for all t ≥ 0 regardless of initial conditions.

Linearization of 1D ODEs

y′ = F [y]

−→ y′ = ay + b

−→ y′ = ay

y′ = F [y]

−→ y′ = ay + b

−→ y′ = ay

y′ = F [y]

−→ y′ = ay + b

−→ y′ = ayCS 205A: Mathematical Methods Ordinary Differential Equations I 21 / 35

Model Equation

y′ = ay

=⇒ y(t) = Ceat

Model Equation

y′ = ay

=⇒ y(t) = Ceat

Stability: Visualization

y′ = ay

Three Cases

y′ = ay, y(t) = Ceat

1. a = 0: Stable

2. a < 0: Stable; solutions get closer

3. a > 0: Unstable; mistakes in initial data

amplified

Three Cases

1. a = 0: Stable

amplified

Three Cases

1. a = 0: Stable

amplified

Intuition for Stability

An unstable ODE magnifies mistakes in the

initial conditions y(0).

Multidimensional Case

~y′ = A~y, A~yi = λi~yi (where A = A>)

~y(0) =∑i

=⇒ ~y(t) =∑i

cieλit~yi

Stability depends on maxi λi.

~y(0) =∑i

=⇒ ~y(t) =∑i

cieλit~yi

~y(0) =∑i

=⇒ ~y(t) =∑i

cieλit~yi

Integration Strategies

Given ~yk at time tk, generate ~yk+1 assuming

~y′ = F [~y].

Forward Euler

~yk+1 = ~yk + hF [~yk]

I Explicit method

I O(h2) localized truncation error

I O(h) global truncation error;

“first order accurate”

Forward Euler: Stability

Model Equation

y′ = ay −→ yk+1 = (1 + ah)yk

For a < 0, stable when h < 2|a|.

Backward Euler

~yk+1 = ~yk + hF [~yk+1]

I Implicit method

I O(h2) localized truncation error

I O(h) global truncation error;

“first order accurate”

Backward Euler: Stability

Model Equation

y′ = ay −→ yk+1 =1

1− ahyk

Unconditionally stable!

But this has nothing to do with accuracy.

Good for stiff equations.

Model Equation

y′ = ay −→ yk+1 =1

1− ahyk

Model Equation

y′ = ay −→ yk+1 =1

1− ahyk

Numerical Stiffness for IVP ODEs

An IVP is said to be numerically “stiff” if

stability requirements dictate a much smaller

time step size than is needed to satisfy the

approximation requirements alone.

[Ascher & Petzold 1998]

Forward and Backward Euleron Linear ODE

~y′ = A~y

I Forward Euler: ~yk+1 = (I + hA)~ykI Backward Euler: ~yk+1 = (I − hA)−1~yk

ordinary differential equations i - computer...

Documents