First Order Initial Value Problems

Similar documents
The Contraction Mapping Theorem and the Implicit Function Theorem

The Contraction Mapping Theorem and the Implicit and Inverse Function Theorems

Answers to Problem Set Number MIT (Fall 2005).

Review: Power series define functions. Functions define power series. Taylor series of a function. Taylor polynomials of a function.

Some lecture notes for Math 6050E: PDEs, Fall 2016

Lattices and Periodic Functions

Nonlinear Control Systems

Nonlinear Systems and Control Lecture # 19 Perturbed Systems & Input-to-State Stability

Convergence & Continuity

Projectile Motion. Engineering Mechanics: Dynamics. D. Dane Quinn, PhD. Copyright c 2016 All rights reserved

d(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N

An introduction to Mathematical Theory of Control

THE INVERSE FUNCTION THEOREM

On boundary value problems for fractional integro-differential equations in Banach spaces

Linear Ordinary Differential Equations

Putzer s Algorithm. Norman Lebovitz. September 8, 2016

Lecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.

Existence and uniqueness of solutions for nonlinear ODEs

Functions of a Complex Variable (S1) Lecture 11. VII. Integral Transforms. Integral transforms from application of complex calculus

at time t, in dimension d. The index i varies in a countable set I. We call configuration the family, denoted generically by Φ: U (x i (t) x j (t))

Arc Length and Riemannian Metric Geometry

Stochastic Differential Equations.

Exercise Solutions to Functional Analysis

An homotopy method for exact tracking of nonlinear nonminimum phase systems: the example of the spherical inverted pendulum

PREPRINT 2009:10. Continuous-discrete optimal control problems KJELL HOLMÅKER

Remarks on decay of small solutions to systems of Klein-Gordon equations with dissipative nonlinearities

St. Petersburg Math. J. 13 (2001),.1 Vol. 13 (2002), No. 4

THE HARTMAN-GROBMAN THEOREM AND THE EQUIVALENCE OF LINEAR SYSTEMS

Metric Spaces and Topology

MATH 722, COMPLEX ANALYSIS, SPRING 2009 PART 5

The Inverse Function Theorem via Newton s Method. Michael Taylor

2.1 Dynamical systems, phase flows, and differential equations

LMI Methods in Optimal and Robust Control

Forchheimer Equations in Porous Media - Part III

Pogorelov Klingenberg theorem for manifolds homeomorphic to R n (translated from [4])

A MAXIMUM PRINCIPLE FOR A MULTIOBJECTIVE OPTIMAL CONTROL PROBLEM

Derivatives of Harmonic Bergman and Bloch Functions on the Ball

ODE Homework 1. Due Wed. 19 August 2009; At the beginning of the class

AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES

An idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim

Nonlinear Control. Nonlinear Control Lecture # 2 Stability of Equilibrium Points

EE363 homework 7 solutions

Lecture 4: Numerical solution of ordinary differential equations

1 Lesson 1: Brunn Minkowski Inequality

Tonelli Full-Regularity in the Calculus of Variations and Optimal Control

A LOCALIZATION PROPERTY AT THE BOUNDARY FOR MONGE-AMPERE EQUATION

MATH 202B - Problem Set 5

Chapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27

Liquid crystal flows in two dimensions

Metric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg

Stability of Stochastic Differential Equations

Final Exam. Monday March 19, 3:30-5:30pm MAT 21D, Temple, Winter 2018

Exercises from other sources REAL NUMBERS 2,...,

Observer design for a general class of triangular systems

MATH 220 solution to homework 4

Introduction to numerical simulations for Stochastic ODEs

3. 4. Uniformly normal families and generalisations

Extremal Solutions of Differential Inclusions via Baire Category: a Dual Approach

Half of Final Exam Name: Practice Problems October 28, 2014

An introduction to rough paths

ON THE UNIQUENESS OF SOLUTIONS TO THE GROSS-PITAEVSKII HIERARCHY. 1. Introduction

A.Piunovskiy. University of Liverpool Fluid Approximation to Controlled Markov. Chains with Local Transitions. A.Piunovskiy.

Bernoulli Polynomials

Path Decomposition of Markov Processes. Götz Kersting. University of Frankfurt/Main

ON CALCULATING THE VALUE OF A DIFFERENTIAL GAME IN THE CLASS OF COUNTER STRATEGIES 1,2

arxiv: v1 [math.ca] 23 Jun 2018

02. Measure and integral. 1. Borel-measurable functions and pointwise limits

Solutions. Problems of Chapter 1

Calculus & Analytic Geometry I

NON-SCALE-INVARIANT INVERSE CURVATURE FLOWS IN EUCLIDEAN SPACE

ECE 3620: Laplace Transforms: Chapter 3:

Differentiating Series of Functions

Iowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions

Least Squares Based Self-Tuning Control Systems: Supplementary Notes

CONVEXITY IN HAMILTON-JACOBI THEORY 2: ENVELOPE REPRESENTATIONS

for all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true

Optimal Control of Switching Surfaces

or E ( U(X) ) e zx = e ux e ivx = e ux( cos(vx) + i sin(vx) ), B X := { u R : M X (u) < } (4)

Continuous approximation of linear impulsive systems and a new form of robust stability

56 4 Integration against rough paths

Nonlinear equations. Norms for R n. Convergence orders for iterative methods

Mathematical Analysis Outline. William G. Faris

Ordinary Differential Equation Theory

EXISTENCE THEOREMS FOR FUNCTIONAL DIFFERENTIAL EQUATIONS IN BANACH SPACES. 1. Introduction

Types of Real Integrals

ẋ = f(x, y), ẏ = g(x, y), (x, y) D, can only have periodic solutions if (f,g) changes sign in D or if (f,g)=0in D.

The principle of concentration-compactness and an application.

CURVATURE ESTIMATES FOR WEINGARTEN HYPERSURFACES IN RIEMANNIAN MANIFOLDS

An anti-windup control of manufacturing lines: performance analysis

Integration in the Complex Plane (Zill & Wright Chapter 18)

2 Statement of the problem and assumptions

From the Newton equation to the wave equation in some simple cases

A Lie Group. These notes introduce SU(2) as an example of a compact Lie group. SU(2) = { A A a 2 2 complex matrix,deta = 1,AA = A A = 1l }

ME Fall 2001, Fall 2002, Spring I/O Stability. Preliminaries: Vector and function norms

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS

Fragmentability and σ-fragmentability

The first order quasi-linear PDEs

Second order Volterra-Fredholm functional integrodifferential equations

MAT1000 ASSIGNMENT 1. a k 3 k. x =

Nonlinear Dynamical Systems Ninth Class

Transcription:

First Order Initial Value Problems A first order initial value problem is the problem of finding a function xt) which satisfies the conditions x = x,t) x ) = ξ 1) where the initial time,, is a given real number, the initial position, ξ IR d, is a given vector and : IR d IR IR d is a given function. We shall assume throughout these notes that is C. By definition, a solution to the initial value problem 1) on the interval I which may be open, closed or half open, but which, of course, contains ) is a differentiable function xt) which obeys x ) = ξ and xt) = xt),t ) for all t I Remark 1 The restriction to first order derivatives is not significant. Higher order systems can always be converted into first order systems, at the cost of introducing more variables. For example, substituting y = x z = x into the second order system x = x, x,t) converts it to the first order system d dt [ ] [ y = z ] z F y, z,t) Theorem 2 Let d IN, IR, ξ IR d and I be an interval in IR that contains. Assume that : IR d IR IR d is C. a) Regularity in t) A solution to the initial value problem 1) on I is C. b) Uniqueness) If xt) and yt) are both solutions to the initial value problem 1) on I, then xt) = yt) for all t I. Remark: For uniqueness, it is not sufficient to assume that is continuous. For example xt) = and xt) = 2 3 t) 3/2 both solve the initial value problem x) =, ẋ = 3 x. c) Local Existence) Le < ρ < and let C ρ ξ ) denote the closed ball in IR d with centre ξ and radius ρ. Then there exists a T > such that the initial value problem 1) has a c Joel Feldman. 27. All rights reserved. September 6, 27 First Order Initial Value Problems 1

solution xt) on the interval [ T, +T] with xt) C ρ ξ ) for all t [ T, +T]. Furthermore, if we fix any θ > and define M = sup { F x,t) x Cρ ξ ), t θ which is the maximum speed that x can have while t θ and x is in C ρ ξ )), then T min { θ, ρ M Remark: The bad news is that solutions of 1) need not exist for all t. For example, ẋ = x 2, x) = 1 has solution xt) = 1, which blows up at t = 1, despite the fact that t 1 the problem ẋ = x 2, x) = 1 shows no sign of pathology. Another example is ẋ = x 2 x) = 1 ẏ = x 2 cosx x 3 sinx y) = cos1 The solution is xt) = 1 t 1, yt) = 1 t 1 cos 1, which oscillates wildly while it is blowing t 1 up. The good news is that solutions, which we already know exist at least for times near, can only fail to globally exist i.e. exist for all t) under specific, known, circumstances, that can often be ruled out. d) Absence of a Global Solution) Let a < b with at least one of a, b finite. Let xt) be a solution of 1) on the interval a,b). Suppose that there does not exist a solution on any interval that properly contains a, b). Then b < = limsup xt) = t b a > = limsup xt) = t a+ Remark: It suffices to consider open intervals a, b), because given a solution on some nonopen interval I, we can always use part c) to extend it to a solution on an open interval that contains I. e) Global Existence) Suppose that a function H x) is conserved by all solutions of 1). In other words, suppose that if xt) obeys 1), then d dth xt)) =. Suppose further that lim H x) =. Then every solution of 1) on an interval properly contained in IR may x be extended to a global solution. f) Regularity with respect to initial conditions and other parameters) Let F x,t, α) be C. Let θ,ρ,a >. Then there is a T > such that i) For each τ, ζ and α obeying τ < θ, ξ ξ < ρ and α α < a, there is a solution xt; τ, ξ, α) to the initial value problem x = F x,t, α) xτ) = ξ on the interval [τ T,τ +T]. ii) xt; τ, ξ, α) is C as a function of all of its arguments in the region given in i). c Joel Feldman. 27. All rights reserved. September 6, 27 First Order Initial Value Problems 2

Proof: a) Let xt) be a solution to the initial value problem 1) on I. By hypothesis, it is differentiable on I. Hence it is continuous on I. As is continuous, xt) = xt),t) is a composition of continuous functions, and hence is continuous. That is, xt) is C 1 on I. So xt) = xt),t) is also C 1 with derivative d j=1 d F xt),t) dx j dt t)+ F t xt),t) = F F j xt),t)+ F t xt),t) j=1 which is again continuous. So xt) is C 2 on I. And so on. b) Let J be any closed finite interval containing and contained in I. We shall show that xt) = yt) for all t J. Since J is compact and xt) and yt) are continuous, both xt) and yt) are bounded for t J. Let S be a sphere in IR d that is sufficiently large that it contains xt) and yt) for all t J. Define and, for each T >, let Since x ) = y ), { d M S = sup i,j=1 F i x,t) x S, t J MT) = sup { xt) yt) t t T t ] xt) yt) = [ xτ) yτ) dτ [ ) )] = F xτ),τ F yτ),τ dτ Now, for any x, y S and τ J, x,τ ) y,τ ) = = d j,k=1 d dσf σ x+1 σ) y,τ ) dσ d ) x j y j ) xjf) σ x+1 σ) y,τ dσ j=1 x j y j xj F k σ x+1 σ) y,τ ) dσ x y M S dσ = M S x y 2) c Joel Feldman. 27. All rights reserved. September 6, 27 First Order Initial Value Problems 3

Hence, for all t J, t xt) yt) M S xτ) yτ) dτ If t J and t T, the same is true for all τ between and t so that t t xt) yt) M S xτ) yτ) dτ M S MT) dτ = t M S MT) TM S MT) Taking the supremum over t J with t T gives MT) TM S MT) If T 1, we have MT) 1 2 MT) which forces Mt) = for all t J with t T. 1 If isnot sufficiently big that [ 1, + 1 ] covers all ofj, repeat with replaced by ± 1 and then ±2 1, and so on. c) We shall construct a local solution to the integral equation xt) = ξ + xτ),τ ) dτ 3) which is equivalent to the initial value problem 1). To do so, we construct a sequence of approximate solutions by the algorithm x ) t) = ξ x 1) t) = ξ + x 2) t) = ξ +. x n) t) = ξ + x ) τ),τ ) dτ x 1) τ),τ ) dτ x n 1) τ),τ ) dτ 4) Ifthesequence x n) t)ofapproximatesolutionsconvergesuniformlyonsomeclosedinterval [ T, +T], then taking the limit of 4) as n shows that xt) = lim n xn) t) obeys 3) and hence 1). Define T = min { θ, ρ M { d L = sup i,j=1 F i x,t) x Cρ ξ ), t T µ k = sup{ x k) t) x k+1) t) t t T c Joel Feldman. 27. All rights reserved. September 6, 27 First Order Initial Value Problems 4

It suffices to prove that µ k <, since then we will have uniform convergence. k= We first verify that x n) t) remains in C ρ ξ ) for all n and t T. Since MT ρ, we have sup x n) t) t ξ sup F x n 1) τ),τ ) dτ t T t T T sup x n 1) τ),τ ) τ T TM ρ if x n 1) τ) C ρ ξ ) for all τ T and it follows, by induction on n, that x n) t) ξ ρ i.e. x n) t) C ρ ξ )) for all t T. Now x k) t) x k+1) t) = as in 2). Iterating this bound gives x k) t) x k+1) t) L 2 dτ 1. L k = L k L k [ F x k 1) τ),τ ) F x k) τ),τ )] dτ L x k 1) τ 1 ) x k) τ 1 ) dτ1 dτ 1 dτ 1 dτ 1 dτ 2 x k 2) τ 2 ) x k 1) τ 2 ) dτ 2 dτ 2 = L k ρ 1 k! t k dτ 2 τk 1 τk 1 τk 1 dτ k x ) τ k ) x 1) τ k ) dτ ξ k x 1) τ k ) dτ k ρ and hence µ k ρ 1 k! LT)k = ρe LT k= k= d) This is easy. If the solution stays bounded near one end of the interval, say on [b ε,b) with b <, we can use the local existence result of part c) to extend the solution past b simply by choosing very close to b. c Joel Feldman. 27. All rights reserved. September 6, 27 First Order Initial Value Problems 5

e) This is also easy. If h = H ξ ), then any solution xt) must remain in Since lim x X h = { x H x) = h H x) =, the region Xh is bounded. Apply part d). f) Outline of proof only.) The idea of the proof is the same as that for part c) local existence). For each fixed τ, ξ, α), the solution xt; τ, ξ, α) is the limit of the sequence defined recursively by x ) t; τ, ξ, α) = ξ x n) t; τ, ξ, α) = ξ + τ F x n 1) τ ; τ, ξ, α),τ, α ) dτ n = 1, 2, 3, 5) As in part a), it is obvious by induction on k that x k) t; τ, ξ, α) is C in all of its arguments. To prove that the limit as k is C, it suffices to prove that all derivatives of x k) converge uniformly as k. So it suffices to prove that for any possibly higher order) derivative D, µ D,k = sup D x k) D x k+1) obeys µ D,k <. But we can bound µ D,k by applying D to the recursion relation 5) k= and then using the method of part c). c Joel Feldman. 27. All rights reserved. September 6, 27 First Order Initial Value Problems 6