Advanced methods for ODEs and DAEs. Lecture 9: Multistep methods/ Differential algebraic equations
|
|
- Cynthia Sharp
- 5 years ago
- Views:
Transcription
1 Advanced methods for ODEs and DAEs Lecture 9: Multistep methods/ Differential algebraic equations Bojana Rosic, 22. Juni 2016
2 PART I: MULTISTEP METHODS 22. Juni 2016 Bojana Rosić Advanced methods for ODEs and DAEs Seite 2
3 Multistep methods Numerical methods for solving ODE x = f (x, t) can be classified as one step methods : these methods use only information from one time point to compute the next xn+1 = xn + hf (tn, xn ) requires nowledge on xn multistep methods: these methods require nowledge on more than one time point 3 1 xn+1 = xn + h fn fn 1 requires nowledge on xn, xn Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 3
4 Multistep methods (MM) To integrate ODE x = f (x, t) one may use explicit MM : interpolate f (rhs/derivative) by using points xn = x(tn ), xn 1 = x(tn 1 ),..., xn +1 = x(tn +1 ) implicit MM: interpolate f (rhs/derivative) by using points xn+1 = x(tn+1 ), xn = x(tn ),,..., xn +1 = x(tn +1 ) such that P(ti ) = f (ti, x(ti )) and Z tn+1 x(tn+1 ) x(tn j ) = Z tn+1 f (t, x(t))dt = tn j P(t)dt, tn j 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 4 j > 0, j 6
5 Multistep methods (MM) in which for explicit MM : P(t) = p fn `n = =0 p p Y t tn l. tn tn l l=0 fn =0 l6= p x(tn+1 ) x(tn j ) = wjnp fn =0 and for implicit MM: P(t) = p = 1 fn p Y l= 1 l6= x(tn+1 ) x(tn j ) = t tn l. tn tn l p wjnp fn = Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 5
6 Examples Adams-Bashford formulas (explicit) : =1: =2: =3: =4: xn+1 xn+1 xn+1 xn+1 = xn + hfn, = xn + h 32 fn 12 fn 1, = xn + h 12 fn 12 fn = xn + h 55 f 24 n 24 fn fn fn 2, 9 24 fn 3 Adams-Moulton formulas (implicit): =1: xn+1 =2: xn+1 =3: xn+1 h (fn+1 + fn ), = xn + h 12 fn fn 12 fn 1, h (9fn fn 5fn 1 + fn 2 ) = xn + 24 = xn Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 6
7 Bacward differentiation formulas Similar to Adams-Moulton formulas with the only difference that the solution is being interpolated, i.e. (tn+1, x(tn+1 )),..., (t p, x(t p )) are used for the approximation of the solution x(t) P(ti ) = x(ti ) and not its derivative f (t, x). However, one also has to satisfy dp (tn+1 ) = f (tn+1, xn+1 ). dt 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 7
8 Example Interpolate x by a polynomial P = at + b such that 1) P(tn ) = atn + b = xn, 2) P(tn+1 ) = atn+1 + b = xn+1 and d (at + b) = a, dt By susbtructing 1) and 2) we have P (t) = a= x t = f (t, x) xn+1 xn xn+1 xn = P (tn+1 ) = a = f (tn+1, xn+1 ) tn+1 tn h f (tn+1, xn+1 ) = xn+1 xn xn+1 = xn + hf (tn+1, xn+1 ) tn+1 tn and hence one has obtained the first order BDF method. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 8
9 Bacward differentiation formulas In a similar manner by taing higher number of nown points and polynomial order one may derive the general formula s a xn+ = hβf (tn+s, xn+s ), =0 which further may loo lie s s s =1: =2: =3: xn+1 xn+2 43 xn xn 9 2 xn xn xn+1 11 xn = xn + hf (tn+1, xn+1 ) = 32 hf (tn+2, xn+2 ) 6 = 11 hf (tn+3, xn+3 ) 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 9
10 Linear multistep methods (LMM) For a system of equations x = f(t, x), x(t0 ) = x0, the general linear multistep method reads i=0 ai xn+i = h bi fn+i, (1) i=0 in which ai and bi are the coefficients of the -step method and fj := f(tj, xj ). On the other side, the exact solution satisfies: x a (tn ) = f(tn, xa (tn )) 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 10
11 Accuracy and consistency order The local error reads loc = xa (tn+ ) x(tn+ ) in which a x(tn+ ) = 1 j=0 aj xa (tn+j ) + h bj f (tn+j, xa (tn+j )) j=0 By following derivation given in Lecture 12 (ODE1), one finally obtains 2 j loc = aj xa (tn ) + h (jaj bj ) xa0 (tn ) + h2 ( aj jbj ) xa00 (tn ) 2 j=0 j=0 j=0 q+1 q j j (q+1) + + hq+1 [ ( aj bj ) xa (tn ) + O(hq+2 ) (q + 1)! q! j=0 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 11
12 Accuracy and consistency order The linear multistep is consistent if lim h 0 loc =0 h loc 1 = aj xa (tn ) + (jaj bj ) xa0 (tn ) h h j=0 j=0 j2 +h ( aj jbj ) xa00 (tn ) j=0 q+1 q j j (q+1) + + h q [ ( aj bj ) xa (tn ) + O(hq+1 ) (q + 1)! q! j=0 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 12
13 Accuracy and consistency order Hence, the method is consistent of order p if j=0 and aj = 0, (jaj bj ) = 0 j=0 jq j q 1 ( aj bj ) = 0, (q)! (q 1)! q = 2, p j=0 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 13
14 Exercise For the method 32 xn 2xn xn 2 = hfn one has a0 = 1/2, a1 = 2, a2 = 3/2, b0 = b1 = 0, b2 = 1. Hence, al = 0 = a0 + a1 + a2 = 1/ /2 = 0 l=0 (lal bl ) = 0 = a1 + 2a2 b2 = = 0 l=0 1 ν 1 l al l ν 1 bl = 0, ν! (ν 1)! ν=2 l=0 a1 /2 + 4a2 /2 2b2 = = Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 14
15 Zero stability In order to chec if the scheme is convergent, one has to investigate zerostability. This stability is defined on ODE x = 0 After applying LMM, one obtains ρ(ξ) := al xn+l = 0 l=0 which becomes difference equation with general solution: xn = r pi ξni, i=1 where ξi are the roots of the first characteristic polynomial ρ. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 15
16 Zero stability A scheme satisfies the root condition (is zero stable) if every root ξi of the first characteristic polynomial ρ(ξ) = ai ξi. i=0 has magnitude smaller than one, ξi 6 1, and if every root ξi with ξi = 1 is a simple root of ρ. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 16
17 Convergence Definition In order that a consistent scheme is convergent, the following stability property has to be fulfilled: A scheme satisfies the root condition (is zero stable) if every root ξi of the first characteristic polynomial ρ has magnitude smaller than one, ξi 6 1, and if every root ξi with ξi = 1 is a simple root of ρ. However, this defines the stability with respect to the initial conditions. As suspected, this is not enough. One also has to consider stability with the respect to the step size and properties of the system being integrated. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 17
18 Stability Consider the Dahlquist problem x = λx, u(0) = 1 and the linear multistep method ai xn+i = h i=0 It follows i=0 ai xn+i = hλ bi fn+i i=0 bi xn+i i=0 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 18
19 Stability The last one is the difference equation whose solution is power function xn = cξn. By putting the ansatz into the left side of equation one obtains the first characteristic equation ρ(ξ) := ai ξi i=0 whereas in the right hand side the second characteristic polynomial σ(ξ) := ai ξi i=0 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 19
20 Stability Taing that z := λh one may rewrite i=0 ai xn+i = hλ bi xn+i i=0 to 0= (ai zbi )ξi = ρ(ξ) zσ(ξ) i=0 Hence, a stable numerical solution must have the roots which satisfy ξl 6 1 If ξl is a root of multiplicity > 1 then ξl < Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 20
21 Stability region The stability region of the linear multistep method i=0 ai xn+i = h bi fn+i i=0 is defined by Gs := {z : C ; ξl 6 1and if ξl is a root of multiplicity > 1 then ξl < 1} 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 21
22 Root locus curve Note, that on the boundary of Gs at least one root satisfies ξl = 1. Then it follows ρ(ξ) ρ(eiϕ ) z= =, σ(ξ) σ(eiϕ ) where ξ = eiϕ. The root locus curve is defined by C := z C : z= ρ(eiϕ ), ϕ [0, 2π] σ(eiϕ ) 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 22
23 Stability region 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 23
24 A-stability A linear multistep method is called A-stable, if all roots of ρ(ξ) zσ(ξ) = 0 are in region defined by Gs := {z : C ; ξl 6 1and if ξl is a root of multiplicity > 1 then ξl < 1} 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 24
25 Stability region From the previous slide, one may conclude Implicit methods have a larger region of absolute stability than a corresponding explicit method of the same order The absolute stability region typically becomes smaller as order increases BDF methods have the largest stability region compared to other LMM 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 25
26 Problem Theorem No explicit LMM is A-stable. The order of an A-stable LMM cannot exceed two. The second order A-stable LMM with the smallest error coefficient is the trapezoidal rule. Note that no such restriction exists for implicit Runge-Kutta methods. In order to obtain high orders of accuracy with LMMs, we will have to relax our stability demands and give up a portion of the left-half plane. Proof: see Grigorieff (1977) or Hairer/Wanner Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 26
27 A(α)-stability A numerical scheme is called A(α)-stable, if R0 (z) 6 1 for all z C with arg(z) π 6 α, α (0, π/2). (see Widlund, 1967) Im z Re z Im z α α Note, that A(α)-stable with α = π/2 is A-stable. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 27 Re z
28 A(α)-stability For BDF-methods we get s α Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite
29 Implementation of BDF methods When applied on a system of ODEs x = f(t, x), BDF methods lead to a non-linear system of the form G(xn+ ) := xn+ h b0 fn+ + rn+ = 0, a0 where rn+ includes the values xn+l, l = 0,..., 1. There are at least two possiblities to solve the system: by fixed point iteration and Newton-lie method. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 29
30 Implementation of BDF methods However, we show that for the stiff problems the Newton method is the only one that can be applied since a fixed point iteration may lead to numerical (0) instabilities. The starting values xn+ for Newton s method should not be choosen with an explicit predictor scheme, since numerical instabilities may arise. It is better to interpolate the nown values xn+l. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 30
31 Fixed point iteration Aplying fixed point iteration leads to () xn+1 = () ai xn+i + hb0 f (tn+1, xn+1 ) + i=1 bi fn+i i=1 According to Banach fixed point theorem, this iteration is convergent only when Lh b0 < 1 in which L is the Lipschitz constant. For non-stiff problems L is small and the step size is chosen according to accuracy conditions. However, for stiff problems the step size is very much restricted by this condition. In this case Newton iteration has much better performance. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 31
32 Comparison of one and multistep methods One step methods: To achieve higher orders with one-step methods additional right hand side evaluations are necessary, which might be very inefficient. Consistency is harder to analyze than stability. The analysis is restricted to only one step, which maes a change of step size easier. Linear multistep methods: With linear multistep methods there is an urgent need for appropriate good starting values. There is an intensive use of former inexact values. A change of step size is rather expensive. Stability is easier to analyze in contrast to consistency. In many cases only one additional right-hand side evaluation is needed in each step. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 32
33 PART II: DIFFERENTIAL ALGEBRAIC EQUATIONS 22. Juni 2016 Bojana Rosić Advanced methods for ODEs and DAEs Seite 33
34 What you need to now before this lecture 1. definition of ODEs 2. Lipschitz continuity 3. Inverse theorem 4. Implicit function theorem 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 34
35 Lipschitz continuity A function f is said to be continuously differentiable if the derivative f 0 (t) exists and is itself a continuous function. Lipschitz continuity is a weaer condition than continuous differentiability. A Lipschitz continuous function is pointwise differentiable almost everwhere and wealy differentiable. The derivative is essentially bounded, but not necessarily continuous. Definition A function f : [a, b] R is uniformly Lipschitz continuous on [a, b] (or Lipschitz, for short) if there is a constant C such that f (x) f (y) 6 C x y for all x, y [a, b]. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 35
36 Lipschitz continuity Example: a function f = t is not strongly but wealy differentiable. Why? Because the derivative does not exist at t = 0. Namely, the limit t + h t lim h 0 h at t = 0 loos lie 0 + h 0 h = lim h 0 h 0 h h lim and hence, does not exist. But the function is wealy differntiable. It has derivative everywhere except at t = Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 36
37 Inverse function theorem Let F be a C, > 1 map from an open neighborhood of p0 Rn Rn ; with q0 = F (p0 ). Suppose the derivative DF (p0 ) is invertible. Then there is a neighborhood U of p0 and a neighborhood V of q0 such that F : U V is one-to-one (injective) and onto (surjective), i.e. bijective, and F 1 : V U is a C map. (One says F : U V is a diffeomorphism.) 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 37
38 Inverse function theorem 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 38
39 Implicit function theorem Suppose U is a neighborhood of x0 Rm ; V a neighborhood of y0 R` ; and we have a C map F : U V R` Assume Dy F (x0 ; y0 ) is invertible. Then the equation F (x; y) = u0 defines y = g(x; u0 ) for x near x0 (satisfying g(x0 ; u0 ) = y0 ) with g a C map. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 39
40 Implicit function theorem Let us observe function F (x, y) = x 2 + y 2 1 which satisfies F (x, y) = 0. The derivative is Dy F = 2y for which one may distinguish two cases: 1. when y > 0 Dy F > 0 y = p 1 x2 2. and when y < 0 p Dy F < 0 y = 1 x 2 Only when Dy F 6= 0 one may express y as a function of x. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 40
41 Explicit-implicit ODEs Until now we have studied ordinary differential equations which can be given in explicit x = f (x, t) or implicit F (t, x, x ) = 0 form. Most of time we were focusing on the first group of ODEs. However, in a similar manner one can solve the second one. Namely, one only has to transform the implicit equation to the explicit one. This actually means that one has to solve F (t, x, x ) = 0 for x. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 41
42 Inverse and implicit function theorem Provided that we have some continuity in F and non-zero denomenator J= F 6= 0, x one may state x = f (x, t) This then allows us to apply the numerical scheme directly on the explicit case. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 42
43 Exercise: Example I Let be given the implicit formula x1 x = 0 x 1 x2 + x = 0 such that 1 x2 0 x 1 1 x1 = 1 x 2 2 holds. Hence, in order to obtain explicit formula x = f(x, t) one would have to invert 1 0 J= x2 1 Because det J 6= 0, this is possible. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 43
44 Exercise: Example II Let be given the implicit formula x1 x = 0, x 1 x2 + 2 = 0 such that 1 x x1 x 1 = x 2 2 holds. Notice that Jacobian 1 J= x2 0 0 is not invertible any more because det J = 0. Does this means that we have a problem??!! 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 44
45 Is it really? 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 45
46 Differential algebraic equations Hence, the problem given by F (x, x, t) = 0 for which J = x F is singular, is not ODE but differential algebraic equation (DAE). ODEs are only special cases of DAE for which Jacobian is regular. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 46
47 Exercise: Go bac to example II Note that in x1 x = 0 x 1 x2 + 2 = 0 the Jacobian 1 J= x2 0 0 is singular without any influence of the variable x2. Also, the derivative of x2 does not appear in equations. This means that we do not have two differential equations. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 47
48 Exercise: Go bac to example II By resolving the first equation x 1 = x1 + 1 and substituting in (x1 + 1)x2 + 2 = 0 one obtains one differential followed by an algebraic equation. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 48
49 Why studying DAEs DAEs are very often appearing in engineering practice. Some of examples are mutlibody systems (robots, cars, leg prosthesis etc.) chemical industry electrical engineering etc. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 49
50 Planar pendulum By arranging balance differential equations mx = Fx my = Fy mg Iy α = M Fx` cos α Fy ` sin α together with algebraic constaints x = ` sin α y = ` cos α one obtains differential algebraic equations. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 50
51 Electrical circuit Ohm s law: C v c = ic, Lv L = il, vr = RiR together with Kirchhoff s voltage law: vr + vl + vc = v(t) maes an DAE system. Here, vr, vl, vc are the voltages across R,L and C respectively and v(t) is the time varying voltage from the source. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 51
52 Chemical reaction Robertson reaction describes the inetics of an autocatalytic reaction A 1 B B + B 2 C + B B + C 3 A + C A0 = 0.04A BC B 0 = 0.04A BC B 2 A+B+C =1 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 52
53 Classification DAEs can be implicit F (x, x, t) = 0 and semi-explicit ones x = f (t, x, y) 0 = g(t, x, y) in which x is dependent/differentiable variable, y is independent/algebraic variable, and g(t, x, y) is the algebraic constraint. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 53
54 Classification DAEs can be broadly classified to nonlinear F (x, x, t) = 0 F is nonlinear w.r.t. any of arguments and linear ones A(t)x + B(t)x(t) = f (t) 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 54
55 Classification Furthermore, DAEs can be classified according to how far are they from pure ODEs or pure algebraic equations. Thus, the equations can be classified according to differentiation index perturbation index Kronecer index tractability index geometric index strangeness index 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 55
56 Index Solving a DAE is more difficult than solving ODE. Namely, the solution depends on derivatives of the model equations or input functions. Also, the algebraic equations restrict the dynamics of the system and sometimes it is difficult to fullfil them numerically. Initial conditions are another problem because they need to agree with the algebraic constraints at each time moment. All of these and some more difficulities are measured via previously mentioned incdices. Hence, indices can be udnerstood as some ind of measure of difficulty in solving DAE. The higher index is, the more difficult is to solve the corresponding DAE. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 56
57 Differentiation index Definition The nonlinear DAE F (x, x, t) = 0 has differentiation index id if id is the minimal number of differntiations df = 0, dt d 2F = 0, dt 2 d id F =0 dt id such that equations allow to extract an explicit ordinary differential system x = f (x, t) using only algebraic manipulations. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 57
58 Differentiation index it counts the minimal number of times that all or part of the equations in the system must be differentiated in order to obtain pure ODE. Hence, it measures how far the given DAE system is from an equivalent explicit ODE system. Higher differentiation index more difficult to solve DAE. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 58
59 Exercise Determine differentiation index of following DAE u = cos(t) u(t) z (t) = 0 Answer: Writing equations in the following form u = cos(t) z = u(t) one may notice that id = 0. Hence, this is ODE. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 59
60 Exercise Determine differentiation index of following DAE u=t Answer: After differentiation of previous equation, one obtains ODE u = 1. Hence, id is Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 60
61 Exercise Determine differentiation index of following DAE u1 = t 2 u2 = u 1 Answer: After differentiation of the first equation one obtains u 1 = 2t u2 = 2t and similarly u 1 = 2t u 2 = u 1 = 2. Hence, id is Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 61
62 Exercise Determine differentiation index of following DAE u 1 = u3 0 = u2 (1 u2 ) 0 = u1 u2 + u3 (1 u2 ) t From second equation one may notice that u2 can be either 0 or 1. Hence, the differentitaion index will depend on u2 value: I case: u2 = 0 u3 = t and u 1 = u3. Hence, after one differentiation (id = 1) one obtains u 1 = t and u 3 = Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 62
63 Exercise II case u2 = 1 u1 = t and u 1 = u3. Hence, after differentiating u1 = t one obtains u 1 = 1 and hence 1 = u3. After differentiation of 1 = u3 one obtains u 3 = 0 and u 1 = 1. Thus, id = Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 63
64 Maximal differentation index Let F be a family of right-hand sides such that, for any δ F, the DAE has only one solution. Then the maximum differentiation index is =δ. imd := max id is the differentiation index of F (t, x, x ) δ F 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 64
65 Perturbation index This index is a measure of sensitivity of the solutions with respect to the perturbations of the given problem. Before we give definition of the perturbation index let us observe the semi-explicit system y 0 = f (y, z) 0 = g(y, z) and perturb it such that y 0 = f (y, z ) + δ1 (t) 0 = g(y, z ) + δ2 (t) holds. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 65
66 Perturbation index If gz is invertible then one may express variables z and z (Implicit function theorem) from 0 = g(y, z) and 0 = g(y, z ) + δ2 (t). Using Lipschitz continuity condition this further lead us to z z 6 C1 (y y + δ2 (t)) 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 66
67 Perturbation index Further one may substract y 0 = f (y, z) from y 0 = f (y, z ) + δ1 (t) such that y 0 y 0 = f (y, z ) + δ1 (t) f (y, z) holds. After integration of the last equation from 0 to t, one obtains Zt Zt Zt y y = y (0) y(0) + f (y, z )dt + δ1 (t)dt f (y, z)dt Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 67 0
68 Perturbation index Lipschitz condition for Zt Zt f (y, z )dt f (y, z)dt 0 0 reads Zt Zt f (y, z )dt f (y, z)dt 6 C2 0 Zt y ydt + C3 0 z zdt 0 where we have already derived that z z 6 C1 (y y + δ2 (t)) Hence, Zt Zt f (y, z )dt f (y, z)dt 6 C4 0 Zt y ydt + C Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 68 δ2 (t)dt 0
69 Perturbation index Hence, from Zt y y = y (0) y(0) + Zt f (y, z )dt + 0 Zt f (y, z)dt δ1 (t)dt 0 0 follows Zt y y 6 y (0) y(0) + Zt f (y, z ) f (y, z)dt + 0 δ1 (t)dt 0 i.e. y ydt + C3 y y 6 y (0) y(0) + C4 Zt Zt Zt δ2 (t)dt C5 (y (0) y(0) + supδ2 + supδ1 ) τ I τ I 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 69 δ1 (t)dt 0
70 Perturbation index-definition Starting from the DAE F (x, x, t) = 0, we introduce a perturbation δ F of the right-hand side. Loo for a solution x of the DAE x, t) = δ, F (x, in which F is a family of right-hand sides such that for any δ the perturbed DAE has only one solution. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 70
71 Perturbation index-definition Definition The DAE has the perturbation index ip along the solution x on [t0, t], if ip is the smallest integer such that for all x having a defect δ there exists an estimate of the form x (t) x(t) Zt 6 C x (0) x(0) + sup τ I δ(τ) dτ + t0 ip j=1 j 1 δ(τ). sup ( τ)j 1 τ J on [0, T ]. Here, C is a constant that depends on F, the length I of the time interval [t0, t], and on the solution x. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 71
72 Remars For some nonlinear DAEs, the class of perturbations F may have only few elements. It may be possible that such an estimate does not exist. Often only perturbations with δ 6 1 are considered. This restriction can be motivated by the numerical bacground. One is interested in the behavior of a numerical method if the right hand side is disturbed with small perturbations. 22. Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 72
73 Perturbation index Going bac to our example: y y 6 C5 (y (0) y(0) + supδ2 + supδ1 ) τ I one concludes that the perturbation index is ip = Juni 2016 Bojana Rosic Advanced methods for ODEs and DAEs Seite 73 τ I
Advanced methods for ODEs and DAEs
Advanced methods for ODEs and DAEs Lecture 13: Overview Bojana Rosic, 13. Juli 2016 Dynamical system is a system that evolves over time possibly under external excitations: river flow, car, etc. The dynamics
More informationAdvanced methods for ODEs and DAEs
Advanced methods for ODEs and DAEs Lecture 8: Dirk and Rosenbrock Wanner methods Bojana Rosic, 14 Juni 2016 General implicit Runge Kutta method Runge Kutta method is presented by Butcher table: c1 a11
More informationFourth Order RK-Method
Fourth Order RK-Method The most commonly used method is Runge-Kutta fourth order method. The fourth order RK-method is y i+1 = y i + 1 6 (k 1 + 2k 2 + 2k 3 + k 4 ), Ordinary Differential Equations (ODE)
More informationNumerical Differential Equations: IVP
Chapter 11 Numerical Differential Equations: IVP **** 4/16/13 EC (Incomplete) 11.1 Initial Value Problem for Ordinary Differential Equations We consider the problem of numerically solving a differential
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Linear Multistep methods Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the
More informationCHAPTER 5: Linear Multistep Methods
CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order
More informationOrdinary differential equations - Initial value problems
Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter
More informationInitial value problems for ordinary differential equations
Initial value problems for ordinary differential equations Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 IVP
More informationMathematics for chemical engineers. Numerical solution of ordinary differential equations
Mathematics for chemical engineers Drahoslava Janovská Numerical solution of ordinary differential equations Initial value problem Winter Semester 2015-2016 Outline 1 Introduction 2 One step methods Euler
More informationA New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations
A New Block Method and Their Application to Numerical Solution of Ordinary Differential Equations Rei-Wei Song and Ming-Gong Lee* d09440@chu.edu.tw, mglee@chu.edu.tw * Department of Applied Mathematics/
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More information8.1 Introduction. Consider the initial value problem (IVP):
8.1 Introduction Consider the initial value problem (IVP): y dy dt = f(t, y), y(t 0)=y 0, t 0 t T. Geometrically: solutions are a one parameter family of curves y = y(t) in(t, y)-plane. Assume solution
More informationCS 450 Numerical Analysis. Chapter 9: Initial Value Problems for Ordinary Differential Equations
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationCOSC 3361 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods
COSC 336 Numerical Analysis I Ordinary Differential Equations (II) - Multistep methods Fall 2005 Repetition from the last lecture (I) Initial value problems: dy = f ( t, y) dt y ( a) = y 0 a t b Goal:
More informationPart IB Numerical Analysis
Part IB Numerical Analysis Definitions Based on lectures by G. Moore Notes taken by Dexter Chua Lent 206 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationModule 4: Numerical Methods for ODE. Michael Bader. Winter 2007/2008
Outlines Module 4: for ODE Part I: Basic Part II: Advanced Lehrstuhl Informatik V Winter 2007/2008 Part I: Basic 1 Direction Fields 2 Euler s Method Outlines Part I: Basic Part II: Advanced 3 Discretized
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
More information1 Ordinary Differential Equations
Ordinary Differential Equations.0 Mathematical Background.0. Smoothness Definition. A function f defined on [a, b] is continuous at ξ [a, b] if lim x ξ f(x) = f(ξ). Remark Note that this implies existence
More informationModeling & Simulation 2018 Lecture 12. Simulations
Modeling & Simulation 2018 Lecture 12. Simulations Claudio Altafini Automatic Control, ISY Linköping University, Sweden Summary of lecture 7-11 1 / 32 Models of complex systems physical interconnections,
More informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 9 Initial Value Problems for Ordinary Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign
More informationPartitioned Methods for Multifield Problems
C Partitioned Methods for Multifield Problems Joachim Rang, 6.7.2016 6.7.2016 Joachim Rang Partitioned Methods for Multifield Problems Seite 1 C One-dimensional piston problem fixed wall Fluid flexible
More information2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1
Lectures - Week 11 General First Order ODEs & Numerical Methods for IVPs In general, nonlinear problems are much more difficult to solve than linear ones. Unfortunately many phenomena exhibit nonlinear
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 9
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 9 Initial Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationLinear Multistep Methods
Linear Multistep Methods Linear Multistep Methods (LMM) A LMM has the form α j x i+j = h β j f i+j, α k = 1 i 0 for the approximate solution of the IVP x = f (t, x), x(a) = x a. We approximate x(t) on
More informationAdvanced methods for ODEs and DAEs
Lecture : Implicit Runge Kutta method Bojana Roić, 9. April 7 What you need to know before thi lecture numerical integration: Lecture from ODE iterative olver: Lecture 5-8 from ODE 9. April 7 Bojana Roić
More information2 Numerical Methods for Initial Value Problems
Numerical Analysis of Differential Equations 44 2 Numerical Methods for Initial Value Problems Contents 2.1 Some Simple Methods 2.2 One-Step Methods Definition and Properties 2.3 Runge-Kutta-Methods 2.4
More information369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 2017 pp
369 Nigerian Research Journal of Engineering and Environmental Sciences 2(2) 27 pp. 369-374 Original Research Article THIRD DERIVATIVE MULTISTEP METHODS WITH OPTIMIZED REGIONS OF ABSOLUTE STABILITY FOR
More informationMultistep Methods for IVPs. t 0 < t < T
Multistep Methods for IVPs We are still considering the IVP dy dt = f(t,y) t 0 < t < T y(t 0 ) = y 0 So far we have looked at Euler s method, which was a first order method and Runge Kutta (RK) methods
More informationReview: control, feedback, etc. Today s topic: state-space models of systems; linearization
Plan of the Lecture Review: control, feedback, etc Today s topic: state-space models of systems; linearization Goal: a general framework that encompasses all examples of interest Once we have mastered
More informationLinear Multistep Methods I: Adams and BDF Methods
Linear Multistep Methods I: Adams and BDF Methods Varun Shankar January 1, 016 1 Introduction In our review of 5610 material, we have discussed polynomial interpolation and its application to generating
More informationJim Lambers MAT 772 Fall Semester Lecture 21 Notes
Jim Lambers MAT 772 Fall Semester 21-11 Lecture 21 Notes These notes correspond to Sections 12.6, 12.7 and 12.8 in the text. Multistep Methods All of the numerical methods that we have developed for solving
More informationNonlinear Control Systems
Nonlinear Control Systems António Pedro Aguiar pedro@isr.ist.utl.pt 3. Fundamental properties IST-DEEC PhD Course http://users.isr.ist.utl.pt/%7epedro/ncs2012/ 2012 1 Example Consider the system ẋ = f
More informationOn interval predictor-corrector methods
DOI 10.1007/s11075-016-0220-x ORIGINAL PAPER On interval predictor-corrector methods Andrzej Marcinia 1,2 Malgorzata A. Janowsa 3 Tomasz Hoffmann 4 Received: 26 March 2016 / Accepted: 3 October 2016 The
More informationMath 660 Lecture 4: FDM for evolutionary equations: ODE solvers
Math 660 Lecture 4: FDM for evolutionary equations: ODE solvers Consider the ODE u (t) = f(t, u(t)), u(0) = u 0, where u could be a vector valued function. Any ODE can be reduced to a first order system,
More informationTHE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS
THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, S.C. 29208, USA HOWARD@MATH.SC.EDU Abstract. This is an edited version of a
More information5. Ordinary Differential Equations. Indispensable for many technical applications!
Indispensable for many technical applications! Numerisches Programmieren, Hans-Joachim Bungartz page 1 of 30 5.1. Introduction Differential Equations One of the most important fields of application of
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 2: Runge Kutta and Multistep Methods Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 1. Runge Kutta methods 2. Embedded RK methods
More informationCS520: numerical ODEs (Ch.2)
.. CS520: numerical ODEs (Ch.2) Uri Ascher Department of Computer Science University of British Columbia ascher@cs.ubc.ca people.cs.ubc.ca/ ascher/520.html Uri Ascher (UBC) CPSC 520: ODEs (Ch. 2) Fall
More informationCHAPTER 10: Numerical Methods for DAEs
CHAPTER 10: Numerical Methods for DAEs Numerical approaches for the solution of DAEs divide roughly into two classes: 1. direct discretization 2. reformulation (index reduction) plus discretization Direct
More informationORBIT 14 The propagator. A. Milani et al. Dipmat, Pisa, Italy
ORBIT 14 The propagator A. Milani et al. Dipmat, Pisa, Italy Orbit 14 Propagator manual 1 Contents 1 Propagator - Interpolator 2 1.1 Propagation and interpolation............................ 2 1.1.1 Introduction..................................
More informationFunctional Analysis Exercise Class
Functional Analysis Exercise Class Wee November 30 Dec 4: Deadline to hand in the homewor: your exercise class on wee December 7 11 Exercises with solutions Recall that every normed space X can be isometrically
More informationA note on the uniform perturbation index 1
Rostock. Math. Kolloq. 52, 33 46 (998) Subject Classification (AMS) 65L5 M. Arnold A note on the uniform perturbation index ABSTRACT. For a given differential-algebraic equation (DAE) the perturbation
More informationOrdinary Differential Equations
Ordinary Differential Equations Professor Dr. E F Toro Laboratory of Applied Mathematics University of Trento, Italy eleuterio.toro@unitn.it http://www.ing.unitn.it/toro September 19, 2014 1 / 55 Motivation
More informationChapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.
Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for
More informationMath and Numerical Methods Review
Math and Numerical Methods Review Michael Caracotsios, Ph.D. Clinical Associate Professor Chemical Engineering Department University of Illinois at Chicago Introduction In the study of chemical engineering
More informationNumerical integration of DAE s
Numerical integration of DAE s seminar Sandra Allaart-Bruin sbruin@win.tue.nl seminar p.1 Seminar overview February 18 Arie Verhoeven Introduction to DAE s seminar p.2 Seminar overview February 18 Arie
More informationIndex. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems
Index A-conjugate directions, 83 A-stability, 171 A( )-stability, 171 absolute error, 243 absolute stability, 149 for systems of equations, 154 absorbing boundary conditions, 228 Adams Bashforth methods,
More informationIntroduction to Decision Sciences Lecture 6
Introduction to Decision Sciences Lecture 6 Andrew Nobel September 21, 2017 Functions Functions Given: Sets A and B, possibly different Definition: A function f : A B is a rule that assigns every element
More informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationModule 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction
Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction 1 Introduction In this module, we develop solution techniques for numerically solving ordinary
More informationA Family of Block Methods Derived from TOM and BDF Pairs for Stiff Ordinary Differential Equations
American Journal of Mathematics and Statistics 214, 4(2): 121-13 DOI: 1.5923/j.ajms.21442.8 A Family of Bloc Methods Derived from TOM and BDF Ajie I. J. 1,*, Ihile M. N. O. 2, Onumanyi P. 1 1 National
More informationMath 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.
Math 128A Spring 2003 Week 11 Solutions Burden & Faires 5.6: 1b, 3b, 7, 9, 12 Burden & Faires 5.7: 1b, 3b, 5 Burden & Faires 5.8: 1b, 3b, 4 Burden & Faires 5.6. Multistep Methods 1. Use all the Adams-Bashforth
More informationAN OVERVIEW. Numerical Methods for ODE Initial Value Problems. 1. One-step methods (Taylor series, Runge-Kutta)
AN OVERVIEW Numerical Methods for ODE Initial Value Problems 1. One-step methods (Taylor series, Runge-Kutta) 2. Multistep methods (Predictor-Corrector, Adams methods) Both of these types of methods are
More informationBindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 12: Monday, Apr 18. HW 7 is posted, and will be due in class on 4/25.
Logistics Week 12: Monday, Apr 18 HW 6 is due at 11:59 tonight. HW 7 is posted, and will be due in class on 4/25. The prelim is graded. An analysis and rubric are on CMS. Problem du jour For implicit methods
More informationA Family of L(α) stable Block Methods for Stiff Ordinary Differential Equations
American Journal of Computational and Applied Mathematics 214, 4(1): 24-31 DOI: 1.5923/.acam.21441.4 A Family of L(α) stable Bloc Methods for Stiff Ordinary Differential Equations Aie I. J. 1,*, Ihile
More informationMath Numerical Analysis Homework #4 Due End of term. y = 2y t 3y2 t 3, 1 t 2, y(1) = 1. n=(b-a)/h+1; % the number of steps we need to take
Math 32 - Numerical Analysis Homework #4 Due End of term Note: In the following y i is approximation of y(t i ) and f i is f(t i,y i ).. Consider the initial value problem, y = 2y t 3y2 t 3, t 2, y() =.
More informationNonlinear equations. Norms for R n. Convergence orders for iterative methods
Nonlinear equations Norms for R n Assume that X is a vector space. A norm is a mapping X R with x such that for all x, y X, α R x = = x = αx = α x x + y x + y We define the following norms on the vector
More informationmultistep methods Last modified: November 28, 2017 Recall that we are interested in the numerical solution of the initial value problem (IVP):
MATH 351 Fall 217 multistep methods http://www.phys.uconn.edu/ rozman/courses/m351_17f/ Last modified: November 28, 217 Recall that we are interested in the numerical solution of the initial value problem
More informationUniversity of Houston, Department of Mathematics Numerical Analysis II. Chapter 4 Numerical solution of stiff and differential-algebraic equations
Chapter 4 Numerical solution of stiff and differential-algebraic equations 4.1 Characteristics of stiff systems The solution has components with extremely different growth properties. Example: 2 u (x)
More informationConsistency and Convergence
Jim Lambers MAT 77 Fall Semester 010-11 Lecture 0 Notes These notes correspond to Sections 1.3, 1.4 and 1.5 in the text. Consistency and Convergence We have learned that the numerical solution obtained
More informationResearch Article Diagonally Implicit Block Backward Differentiation Formulas for Solving Ordinary Differential Equations
International Mathematics and Mathematical Sciences Volume 212, Article ID 767328, 8 pages doi:1.1155/212/767328 Research Article Diagonally Implicit Block Backward Differentiation Formulas for Solving
More informationSMSTC (2017/18) Geometry and Topology 2.
SMSTC (2017/18) Geometry and Topology 2 Lecture 1: Differentiable Functions and Manifolds in R n Lecturer: Diletta Martinelli (Notes by Bernd Schroers) a wwwsmstcacuk 11 General remarks In this lecture
More informationNumerical Algorithms for ODEs/DAEs (Transient Analysis)
Numerical Algorithms for ODEs/DAEs (Transient Analysis) Slide 1 Solving Differential Equation Systems d q ( x(t)) + f (x(t)) + b(t) = 0 dt DAEs: many types of solutions useful DC steady state: state no
More informationNumerical solution of ODEs
Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationWorksheet 8 Sample Solutions
Technische Universität München WS 2016/17 Lehrstuhl für Informatik V Scientific Computing Univ.-Prof. Dr. M. Bader 19.12.2016/21.12.2016 M.Sc. S. Seckler, M.Sc. D. Jarema Worksheet 8 Sample Solutions Ordinary
More informationThe Plan. Initial value problems (ivps) for ordinary differential equations (odes) Review of basic methods You are here: Hamiltonian systems
Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit V Solution of Differential Equations Part 2 Dianne P. O Leary c 2008 The Plan
More informationMetric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg
Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose
More information4 Stability analysis of finite-difference methods for ODEs
MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture
More informationECE257 Numerical Methods and Scientific Computing. Ordinary Differential Equations
ECE257 Numerical Methods and Scientific Computing Ordinary Differential Equations Today s s class: Stiffness Multistep Methods Stiff Equations Stiffness occurs in a problem where two or more independent
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1- or 2-digit exam number on
More informationMath 128A Spring 2003 Week 12 Solutions
Math 128A Spring 2003 Week 12 Solutions Burden & Faires 5.9: 1b, 2b, 3, 5, 6, 7 Burden & Faires 5.10: 4, 5, 8 Burden & Faires 5.11: 1c, 2, 5, 6, 8 Burden & Faires 5.9. Higher-Order Equations and Systems
More informationLectures 2 3 : Wigner s semicircle law
Fall 009 MATH 833 Random Matrices B. Való Lectures 3 : Wigner s semicircle law Notes prepared by: M. Koyama As we set up last wee, let M n = [X ij ] n i,j=1 be a symmetric n n matrix with Random entries
More informationMATH 205C: STATIONARY PHASE LEMMA
MATH 205C: STATIONARY PHASE LEMMA For ω, consider an integral of the form I(ω) = e iωf(x) u(x) dx, where u Cc (R n ) complex valued, with support in a compact set K, and f C (R n ) real valued. Thus, I(ω)
More informationECE 422/522 Power System Operations & Planning/Power Systems Analysis II : 7 - Transient Stability
ECE 4/5 Power System Operations & Planning/Power Systems Analysis II : 7 - Transient Stability Spring 014 Instructor: Kai Sun 1 Transient Stability The ability of the power system to maintain synchronism
More informationLecture 6: Contraction mapping, inverse and implicit function theorems
Lecture 6: Contraction mapping, inverse and implicit function theorems 1 The contraction mapping theorem De nition 11 Let X be a metric space, with metric d If f : X! X and if there is a number 2 (0; 1)
More informationPicard s Existence and Uniqueness Theorem
Picard s Existence and Uniqueness Theorem Denise Gutermuth 1 These notes on the proof of Picard s Theorem follow the text Fundamentals of Differential Equations and Boundary Value Problems, 3rd edition,
More informationNumerical Analysis: Interpolation Part 1
Numerical Analysis: Interpolation Part 1 Computer Science, Ben-Gurion University (slides based mostly on Prof. Ben-Shahar s notes) 2018/2019, Fall Semester BGU CS Interpolation (ver. 1.00) AY 2018/2019,
More informationOrdinary Differential Equation Theory
Part I Ordinary Differential Equation Theory 1 Introductory Theory An n th order ODE for y = y(t) has the form Usually it can be written F (t, y, y,.., y (n) ) = y (n) = f(t, y, y,.., y (n 1) ) (Implicit
More informationChap. 3. Controlled Systems, Controllability
Chap. 3. Controlled Systems, Controllability 1. Controllability of Linear Systems 1.1. Kalman s Criterion Consider the linear system ẋ = Ax + Bu where x R n : state vector and u R m : input vector. A :
More informationOn the stability regions of implicit linear multistep methods
On the stability regions of implicit linear multistep methods arxiv:1404.6934v1 [math.na] 8 Apr 014 Lajos Lóczi April 9, 014 Abstract If we apply the accepted definition to determine the stability region
More informationDefect-based a-posteriori error estimation for implicit ODEs and DAEs
1 / 24 Defect-based a-posteriori error estimation for implicit ODEs and DAEs W. Auzinger Institute for Analysis and Scientific Computing Vienna University of Technology Workshop on Innovative Integrators
More informationLinear System Theory
Linear System Theory Wonhee Kim Lecture 3 Mar. 21, 2017 1 / 38 Overview Recap Nonlinear systems: existence and uniqueness of a solution of differential equations Preliminaries Fields and Vector Spaces
More informationOrdinary Differential Equations
CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things
More informationSystems of Ordinary Differential Equations
Systems of Ordinary Differential Equations MATH 365 Ordinary Differential Equations J Robert Buchanan Department of Mathematics Fall 2018 Objectives Many physical problems involve a number of separate
More informationMTH 452/552 Homework 3
MTH 452/552 Homework 3 Do either 1 or 2. 1. (40 points) [Use of ode113 and ode45] This problem can be solved by a modifying the m-files odesample.m and odesampletest.m available from the author s webpage.
More informationLinearization problem. The simplest example
Linear Systems Lecture 3 1 problem Consider a non-linear time-invariant system of the form ( ẋ(t f x(t u(t y(t g ( x(t u(t (1 such that x R n u R m y R p and Slide 1 A: f(xu f(xu g(xu and g(xu exist and
More information9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall
c Dr Oksana Shatalov, Fall 2018 1 9 FUNCTIONS 9.1 The Definition of Function DEFINITION 1. Let X and Y be nonempty sets. A function f from the set X to the set Y is a correspondence that assigns to each
More informationSolving Ordinary Differential Equations
Solving Ordinary Differential Equations Sanzheng Qiao Department of Computing and Software McMaster University March, 2014 Outline 1 Initial Value Problem Euler s Method Runge-Kutta Methods Multistep Methods
More informationExponential Integrators
Exponential Integrators John C. Bowman (University of Alberta) May 22, 2007 www.math.ualberta.ca/ bowman/talks 1 Exponential Integrators Outline Exponential Euler History Generalizations Stationary Green
More informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
More informationParallel Methods for ODEs
Parallel Methods for ODEs Levels of parallelism There are a number of levels of parallelism that are possible within a program to numerically solve ODEs. An obvious place to start is with manual code restructuring
More informationFREE Download Study Package from website: &
SHORT REVISION (FUNCTIONS) THINGS TO REMEMBER :. GENERAL DEFINITION : If to every value (Considered as real unless otherwise stated) of a variable which belongs to some collection (Set) E there corresponds
More informationThe Milne error estimator for stiff problems
13 R. Tshelametse / SAJPAM. Volume 4 (2009) 13-28 The Milne error estimator for stiff problems Ronald Tshelametse Department of Mathematics University of Botswana Private Bag 0022 Gaborone, Botswana. E-mail
More informationApplied Math for Engineers
Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationImplicit Functions, Curves and Surfaces
Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then
More informationFIXED POINT ITERATIONS
FIXED POINT ITERATIONS MARKUS GRASMAIR 1. Fixed Point Iteration for Non-linear Equations Our goal is the solution of an equation (1) F (x) = 0, where F : R n R n is a continuous vector valued mapping in
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More information