INDIRECT ADAPTIVE CONTROL
|
|
- Αδελφά Γκόφας
- 6 χρόνια πριν
- Προβολές:
Transcript
1
2 INDIREC ADAPIVE CONROL OULINE. Inroducion a. Main properies b. Running example. Adapive parameer esimaion a. Parameerized sysem model b. Linear parameric model c. Normalized gradien algorihm d. Normalized leas-squares algorihm e. Discree-ime version of adapive algorihms 3. Idenificaion and robusness a. Parameric convergence and persisency of exciaion b. Robusness of adapive algorihms 4. Indirec adapive conrol a. Model reference conrol b. Pole placemen conrol 5. Adapive observers
3 . INRODUCION Dynamic sysems are characerized by heir srucures and parameers: Linear: Nonlinear: :{ x = A( θ) x+ B( θ) u+ d; :{ x = f( x, u, d, θ); Σl Σ y = Cx+ Du+ v, n y = h( x, u) + v, x is sae vecor, u is conrol inpu, d is disurbance, y is oupu, v is noise, θ is parameers. Conrol sysem design seps: u u P P P m y y Σ {, Σ} m l n. Modeling. Conrol design u C P m Δ uncerainy y 3. Implemenaion u C P y Sabiliy, robusness, performance??? 3
4 a. Main properies Parameer esimaion is o use a collecion of available sysem signals y and u, based on cerain sysem srucure informaion Σ l or Σ n, o produce esimaes θ () of he sysem parameers θ Appears on he sep. Adapive parameer esimaion is a dynamic esimaion procedure ha produce updaed parameer esimaes on-line Appears on he sep &3. Adapive parameer esimaion is crucial for indirec adapive conrol design where conroller parameers θ () are some coninuous funcions of he esimaes θ ( ): c u C P m (θ) Sraegy for conrol adjusmen he general scheme of adapive conrol. y u C(θ с ) P m (θ) Adapive parameer esimaion y θ c () Conrol parameer derivaion θ () he scheme of indirec adapive conrol. 4
5 Key issues in he classical adapive parameer esimaion: linear parameerizaion of sysem models, linear represenaion of parameric error models, sable design of adapive esimaion algorihms, analyical proof of sysem sabiliy, parameer convergence, robusness of adapive esimaion. Realizaion: coninuous-ime, discree-ime. 5
6 b. Running example Moving vehicle: V d F f +F l V F e =kn e F e F f <F l F f >F l V is velociy (regulaing variable), V = dv / d is acceleraion, m is unknown vehicle mass, F e is engine force, Fe F f is fricion force, Ff = kne, where e N is orque, k is unknown conversion coefficien, = ρ V, where ρ is unknown fricion coefficien, F l is load force (unknown, dependen on he road profile). he firs order dynamics (Newon's Second Law): mv = F ( F + F ) = kn ρv F. e f l e l 6
7 Define he sae variable x = V, he conrol inpu u = Ne, he disurbance d = Fl / m: x = ax+ bu+ d, () y = x+ v, where y is he oupu, v is he measuremen noise, a = ρ / m, b = k / m. Noe: he engine from he inroducion lecure has he same model. Feaures: he consan parameers a > and b > are unknown () is a varian of Σ l ; he ime-varying signals d and v are unknown, bu bounded; he unperurbed noise-free case: d = v =, he reference signal r = Vd, where d V desired velociy. Conrol problem (he asympoic racking): x () r () wih +. 7
8 A varian of he soluion: u = b [ ay a y+ b r ], where a m > and b m are parameers of he reference model: m m m m m m m x = a x + b r. he closed loop sysem has form: x = a x+ b r+ d, d = d + ( a a ) v. m In he noise-free case ( d = v = d = ) he variable x has he desired dynamics! m o design he conrol u we have o esimae he unknown parameers a and b! Le us ry o solve his problem for he noise-free case. We will analyze he robusness issue laer. In his case he model () can be rewrien as follows: y = ay+ bu. ( ) 8
9 . ADAPIVE PARAMEER ESIMAION a. Parameerized sysem model Consider a linear ime-invarian SISO sysem described by he differenial equaion: y (), u ( ) are he measured oupu and inpu as before; Ps ()[ y]() = Zs ( )[ u](), () n n n m m Ps () = s + p s ps+ p, m Z( s) = z s + z s z s+ z, are polynomials in s, wih s being he differeniaion operaor i m s[ x]() = x () ; p, i =, n and z j, j =, m are he unknown bu consan parameers o be esimaed. Noe: n =, m = ( ) wih p = a and z = b. he objecive: esimae he values p i, i =, n and z j, j =, m using available for on-line measuremens signals y ( ) and u ( ) (no a priori accessible daases). 9
10 Parameerizaion: le n n n Λ () s = s +λ s λ s+λ be a sable polynomial (all zeros are in Re[ s ] < ). hen () can be represened as follows: Ps () Zs () Λ() s Ps () Zs () [ y]() = [ u]() ( )[ y]( ) + [ y]( ) = [ u]( ) Λ() s Λ() s Λ() s Λ() s Λ() s Z( s) Λ( s) P( s) y() = [ u]() + [ y](). (3) Λ( s) Λ( s) Define parameer vecor θ = [ z, z,..., z, z, λ p, λ p,..., λ p, λ p ] n m * + + m m n n n n and regressor funcion m n s s n+ m+ φ () = [ u](),... [ u](), [ y](),... [ y](). Λ() s Λ() s Λ() s Λ() s hen (3) can be expressed in he equivalen form * y () = θ φ(). (4)
11 In (4): he vecor * θ conains all unknown parameers of he sysem (); he regressor φ ( ) can be compued using he filers i s Λ () s, i =, n. Anoher varian of implemenaion: ω () = Aλω () + bu(), ω () = Aλω () + by(), where () n ω, () n ω and Aλ =, λ λ λn λn hen, we generae he regressor φ ( ) from b =. where m m+ ( m+ ) ( n m ) φ () = [{ C ω ()}, ω () ], m ( m+ ) n C = [ I, ] ( φ () = [ ω(), ω () ] for m = n ).
12 Linear parameric model has he form where * n θ b. Linear parameric model * y() = θ φ(),, (4) θ is an unknown parameer vecor, y ( ) is a known (measured) signal, n φ() θ is a known vecor signal (regressor), n = n+ m+ is he dimension of he model. Feaures: ) he model (4) is commonly seen in sysem modeling when unknown sysem parameers can be separaed from known signals. ) he componens of φ ( ) may conain nonlinear and/or filered funcions of y ( ) and u ( ) (or some oher sysem signals). 3) Adapive parameer esimaion based on y, ( ) u ( ) Linear parameric model. Le θ ( ) be he esimae of θ * obained from an adapive updae law, parameric error, hen define he esimaion error * θ * () = () is he θ θ θ ε () = θ() φ() y() = θ() φ() θ φ () = θ () φ(). (5)
13 Example y = ay+ bu. ( ) I has he form () for Ps () = s+ p, Z() s = z wih p = a, z = b, m= n, n =. he filer = Λ () s s +. he parameer vecor he regressor * * * = [ θ, θ ] = [ b, a] θ, n θ =. φ () = [ u](), [ y](). s + s + he fas implemenaion φ () = [ ω(), ω ()] for ω () = ω () + u(), ω () = ω () + y(), he esimaion error for he esimae A λ =, b =. θ() = [ θ (), θ ()] : θ θ ε () = () φ() y() =ω () θ () +ω () θ () y() = =ω()( θ () b) +ω ()( θ () + a) = () φ(). 3
14 c. Normalized gradien algorihm How o updae θ ()? How o minimize he error ε () = θ() φ() y() = θ () φ()? he idea is o choose he derivaive of θ ( ) in a seepes descen direcion in order o minimize a normalized quadraic cos funcional * * ε() θ () φ() φ() θ () ( θ() θ ) φ() φ() ( θ() θ ) J (, θ) = = =, m ( ) m ( ) m ( ) where m ( ) is a normalizing signal no depending (explicily) on θ ( ). he idea of m ( ) choice: φ() φ () / m() has o be bounded (reurn laer o his issue). he seepes descen direcion of J (, θ ) is J (, θ) ε() ε φ() = = ε() θ m () θ m (), herefore: φ() θ () = ε() Γ m (), θ( ) = θ,, (6) where Γ = Γ > is a design marix gain, θ is an iniial esimae of * θ. 4
15 For (6) an admissible choice of he normalizing funcion m ( ) is where κ> is a design parameer. he esimaion error and he regressor: he cos funcional and derivaive: m () = +κφ() φ (), Example ε () =ω() θ () +ω() θ() y(), φ () = [ ω (), ω ()]. ε() [ ω ( ) θ ( ) +ω ( ) θ ( ) y( )] J (, θ) ε() ω J (, θ ) = =, () = m ( ) m ( ) m () ω(). θ he normalized gradien algorihm for Γ = γi, γ > and κ= : ε() ω () θ () = γ ( ) ( ) ω(). +ω +ω 5
16 Lemma. he adapive algorihm (6) guaranees: (i) θ ( ), θ ( ) and ε ()/ m() are bounded (belong o L ); (ii) ε ( ) / m( ) and θ () belong o L. Proof. Inroduce he posiive definie (Lyapunov) funcion, hen ( θ = V ( θ) = θ Γ θ θ ) V = θ Γ θ = θ Γ ε ( ) Γ = ε ( ) = m () m () m () Since V we have: V () φ() θ φ() ε(), L. (7) θ () θ () = all hese signals are bounded. he boundedness of ε ( ) / m( ) follows he boundedness of θ () and he inequaliy L L ε( ) θ ( ) φ( ) φ( ) = m () +κφ( ) φ ( ) +κ φ( ) θ ( ). hen boundedness of θ ( ) follows from he inequaliy φ() ε() φ() φ() ε() θ = ε( ) Γ Γ Γ. (i) m () m () m () +κ φ( ) m () 6
17 Lemma. he adapive algorihm (6) guaranees: (i) θ ( ), θ ( ) and ε ()/ m() are bounded (belong o L ); (ii) ε ( ) / m( ) and θ () belong o L. Proof. Le us rewrie he equaliy (7) in he form ε() = V ( ) and inegrae i: m () ε() d= Vd ( ) V ( ) V ( ) V ( ) ( *) ( *) = = θ θ Γ θ θ < m () ε() herefore L. From he inequaliy m (),, θ Γ φ() ε() +κ φ( ) m () we obain ha θ () belongs o L. (ii) he Lemma is proven. Noe: We did no prove ha * lim θ( ) θ! = 7
18 Discussion: ) he algorihm has equilibriums when θ () =, from (6) we have ) θ() = * φ () = θ () = ε () = φ() θ () = ε() Γ m () : * θ() = θ! θ is no unique equilibrium of (6) (he usual drawback of any gradien algorihm)! * is a measure of deviaion of θ ( ) from θ, and from (7) V V V () = θ() Γ θ() V () [ θ() θ*] Γ [ θ() θ*] = () ( ) = [ θ θ*] Γ [ θ θ *]. 3) From Lemma we have ha ε()/ m() L L and lim ε ( ) / m( ) =. 4) From (7) we have ha he funcion is nonincreasing ( V ( ) ) and bounded from below ( V ( ) ), hus here exiss lim V ( ) = V for some consan V : * V = lim θ( ) θ ; = V > lim θ( ) = θ for some consan vecor θ. 5) if θ ( ) L θ () L L (Lemma ) lim θ ( ) = lim θ( ) = θ. cos( + ) θ () = sin( + ), θ () =.5 + θ () L L, lim θ ( ) =, lim θ ( ) =? n θ 8
19 Example Plan: y = ay + bu. ω Adapive esimaor: () θ () +ω() θ() y() ω () θ ω () = γ ( ) ( ) ω(), () = ω () + u(), +ω +ω ω () = ω () + y(). Simulaion : a =.5, b =, γ = and u ( ) = sin( ),.5 y θ b u θ.5 a Simulaion : a =.5, b =, γ = and u ( ) = sin( ), b y u θ θ a
20 Simulaion 3: a =.5, b =, γ = and u () = e cos(),.5.5 y θ u.5 θ V Conclusions: he convergence of adjused esimaes θ ( ) o heir ideal values * θ depends on he inpu u ; y, u are oscillaing * θ() θ ; y cons, u cons (se-poin) * θ() θ.
21 d. Normalized lease-squares algorihm P() φ() θ () = ε(), θ( ) = θ,, (8) m () () φ() φ() () P () = P P, P( ) = P = P >,, (9) m () m () = +κφ() P φ(), where κ> is a design parameer, θ is he iniial esimae of n n he gain marix () θ P θ. * θ and P is he iniial value of Noe: if P( ) = Γ for all, hen (8) (6); he dimension of (6) is nθ = n + m +, as far as he dimension of (8), (9) is nθ + nθ. ε P ω + P ω θ = m P, Example P ω + P ω P ω + P ω =,,,,,, P,ω + P,ω m P,ω + P,ω P,ω + P,ω m = + P,ω + P,ωω + P,ωω + P,ω.
22 Lemma. he adapive algorihm (8),(9) guaranees: (i) P() = P () > for all, P ( ), P ( ) are bounded; (ii) θ ( ) and ε ()/ m() are bounded (belong o L ), where m () = +φ() φ () ; (iii) ε ( ) / m( ), ε ()/ m() and θ () belong o L ; n n (iv) here exis a consan marix θ θ n θ θ such ha lim P( ) = P, lim θ( ) = θ. Proof. Firs, P() = P () and P ( ) is bounded by he algorihm (9) consrucion: P() φ() φ() P () = P() +κφ ( ) P( ) φ ( ). = Second, he ideniy P () P () I nθ implies d ( ) P() = P() P () P() = m() φ() φ() d, hen inegraing his equaliy we obain: P() = P ( ) + m() τ φ()() τ φ τ dτ,. () P ( ) > P() P ( ) > P () > and P ( ) is bounded. (i)
23 Consider he posiive definie funcion =, hen ( ε ( ) = ( ) φ ( ) V (, θ) θ P() θ θ ) d ( V = θ () P() θ () + θ () P() θ () + θ () P() ) θ () = d φ() P() P() φ() φ() φ() = ε() P() θ () θ () P() ε () + θ () θ () = m () m () m () φ() θ () θ () φ() θ () φ( ) φ( ) θ = ε() ε () + ( ) ε( ) =,. m () m () m () m () () Hence, V ( ) = V [, θ ( )] is bounded, and using () we obain: V () = θ () P( ) θ () + θ () m() τ φ( τ) φ() τ dτ θ () <,. herefore () ( ) () is bounded () θ P θ ( ) θ and θ ( ) are bounded. Boundedness of ε ()/ m() follows he proven propery θ ( ) and he inequaliy L ε( ) θ ( ) φ( ) φ( ) = m () +φ() φ () +φ() φ() θ ( ). (ii) 3
24 Rewriing he equaliy () in he form () ε / m() = V () and inegraing i, we obain: ε() d Vd V V V = ( ) = ( ) ( ) ( ) = ( *) ( *) < m () θ θ P θ θ ε() herefore L and m (),, ε() ε() m() ε() = + L, m () m () m () m () m () m () ε() L L. m () Since P() = P () is bounded and P() = P () P () ( P () is also bounded) we have P() φ() P() φ() ε() θ ( ) = ε ( ) = = m () +κφ( ) P( ) φ( ) m () s s P () P () φ() ε( ) P () φ() ε( ) = = ( ), +κφ( ) ( ) ( ) φ ( ) +κ ( ) φ( ) herefore, θ () L. (iii) s s P s s () P m m () s P s P s s 4
25 he inegraion of he differenial equaion (9) gives for : P τφτφτ ()()() P() τ P() = P ( ) dτ> m() τ P τφτφτ ()()() P() τ P ( ) > dτ. m() τ For any z n θ we have P()()() τφτφτ P() τ > z P( ) z > z z dτ, consequenly, he m() τ scalar funcion P τφτφτ ()()() P() τ f (, z) = z z dτ has properies: m() τ i is a nondecreasing funcion of ; i is upper and lower bounded, hen here exiss f z such ha lim f (, z ) = f z. lim P( ) = P, Noe ha ( ε ( ) =φ( ) θ ( ) ) Pφ Pφ θ = θ = ε= φ PP θ = PP θ m m θ ( ) = P( ) P( ) θ ( ) * * θ θ P P θ θ P P θ θ nθ nθ P. lim ( ) = + lim ( ) ( ) ( ) = + ( ) ( ) = θ. n 5
26 Discussion: ) he algorihm (8) (9) can be presened in he form θ () = P () P () θ () = A(,) θ (), θ ( ) = P( ) P( ) θ ( ), hus i is a linear ime-varying sysem!!! he same as he algorihm (6): φ() φ() φ() θ () = θ () = ε () Γ = Γ θ () = B() θ () m () m (). ) Uniform sabiliy: θ ( ) = P( ) P( ) θ ( ) c θ ( ) for some c >. 3) he leas-squares algorihm (8), (9) minimizes a cos funcion which is an inegral of squared errors a many ime insans wih a penaly on he iniial esimae θ( ) = θ : ( θ( τ) φ( τ) y( τ)) ετ () J (, θ) = dτ+ [ θ() θ ] P [ θ() θ ] = m() τ ( ) = dτ+ θ P θ ( ). m() τ Compare wih he gradien descen algorihm (6): ε() J (, θ ) =. m () 6
27 Example Plan: y = ay+ bu. Esimaor: ε P,ω + P,ω θ = m P,ω + P,,ω P P,ω + P,ω P,ω + P,ω = m P ω + P ω P ω + P ω Simulaion : a =.5, b =, P = I and u ( ) = sin( ),,,,, b y u θ θ a Simulaion : a =.5, b =, P = 5I and u ( ) = sin( ), b y u θ θ a
28 Simulaion 3: a =.5, b =, P = 5I and u ( ) = e cos( ), σ ( ) = P ( ),.5 y θ.8.6 u.5 θ V.6 σ Conclusions: he rae of convergence in he algorihm (8), (9) is a more complex issue han in (6); he convergence of adjused esimaes θ ( ) o heir ideal values * θ depends on he inpu u ; y, u are oscillaing * θ() θ ; y cons, u cons (se-poin) * θ() θ. 8
29 e. Discree-ime version of adapive algorihms Coninuous ime Discree ime {, +, +...}, > is he period. he normalized gradien algorihm: φ()() ε θ( + ) = θ( ) Γ, θ( ) = θ, In m () θ > Γ = Γ >, he normalized leas-squares algorihm: Proprieies: m () = κ+φ() φ (), κ>. φ()() ε θ( + ) = θ( ) P ( ), θ( ) = θ, m () φ() φ() P( ) = P( ) P( ) P ( ), P( ) = P = P >, m () m () = κ+φ() P ( ) φ(), κ>. θ (), ε ( ) / m( ), ε ()/ m() and P() = P () > are bounded; ε ()/ m(), ε ()/ m() and θ( + ) θ ( ) belong o L. 9
30 3. IDENIFICAION AND ROBUSNESS idenificaion parameer convergence; robusness d, v. a. Parameric convergence and persisency of exciaion Lemma 3. For he gradien algorihm (6) or leas-squares algorihm (8) (9), if m () and φ () L, hen lim ε ( ) =. ε() Proof. L L and θ ( ), θ ( ) L m () from lemmas,. Since ( ) ( ) ε =φ θ ( ) we have ε () =φ () θ () +φ() θ (). Hence: φ () L ε () L, m () L ε() L L. Under condiions of lemma 3 asympoically a) φ ( ) = [,,...,] b) φ ( ) = [,,...,] * θ () θ =, θ () for i n θ? n i * i i θ [ θ ( ) θ ] =? c) φ ( ) = sin( ω i ), i =,, ω> i n θ i n n i * i i i ε () = θ [ θ () θ ] φ () =, : * i i θ [ θ i( ) θ ]sin( ω i) = * i θ () =θ, i =,. i n θ L 3
31 Definiion. A bounded vecor signal ϕ(), q, is exciing over he finie ime inerval [ σ, σ +δ ], δ >, σ, if for some α > q σ +δ ϕτϕτ () () dτ α σ I q. Definiion. A bounded vecor signal ϕ(), q, is Persisenly Exciing (PE) if here exis δ> and α> such ha q σ+δ σ ϕ() is PE ρ >, δ> : q ϕ() τ ϕ() τ dτ αi q, σ. ϕτϕτ () () dτ ρ( ) I q, (posiive definie in average). he idea: rank[ ϕ( ) ϕ ( ) ] =, rank[ +δ ϕ ( τ ) ϕ ( τ ) d τ ] = q. +δ Example. ϕ () = [,] ϕ() ϕ () = δ ϕ() τ ϕ() τ d τ= δ no PE. 3
32 () [, e δ δ e ϕ = ] ϕτϕτ () () d τ= δ δ exciing over some finie inervals. e.5e ϕ ( ) = [,sin( )] δ δ cos( δ) ϕ() τ ϕ() τ () d τ= λ δ cos( δ).5δ.5sin( δ) I, 6δ sin( δ) [δ+ sin( δ)] λ( δ ) = + cos( δ) ρδ, ρ =.4 for δ> 5: 8 64 δ 6 λ() ρ 4 PE!!! cos( ) ϕ () = sin( ) δ δ+.5sin( δ) sin( δ) ϕτϕτ () () [ sin()] d τ= δ δ I PE. sin( δ) δ.5sin( δ) 3
33 * Normalized gradien algorihm (6) ( θ () = θ() θ, () () ε =φ θ () ): φ() φ() θ () = θ () = ε () Γ = Γ φ () θ () = B() θ (), m () m () φ() φ() B() = Γ. m () Le Φ (, ) be he sae ransiion marix of he linear ime-varying sysem (6), hen () (,) ( ); θ =Φ θ φ () is PE φ ()/ m(), m () = +κφ() φ () is PE η=φ () (,) φ ()/ m() is PE: ρ >, δ> : Consider he Lyapunov funcion ητητ ()() dτ ρ( ) I n, V ( ) θ = θ Γ θ : θ +δ. θ θ θ θ () () () V ε φ φ = = ( ) ( ) = ηη ( ) ( ) m () m () inegraing his equaliy for +δ we obain ( V ( ) ): = θγ θ V ( ) = V ( ) η ( τ) η ( τ) dτ V ( ) ρ( ) = [ ρ( )] θ θ θθ θ Γ θ lim V ( ) = lim θ( ) = θ. *, 33
34 Normalized leas-squares algorihm (8) (9): Properies: lim P ( ) lim θ ( ) ; = = P τφτφτ P θ ( ) = P( ) P( ) θ ( ),. ()()() () τ P() = P ( ) dτ, P( ) = P ( ) > for all ; m() τ φ () is PE φ ()/ m(), m () = +κφ() φ () is PE η () = P () φ()/ m() is PE: hen ρ >, δ> : ητητ ()() dτ ρ( ) I n, * lim θ( ) = θ. < P( ) = P( ) η ( τ) η ( τ) dτ P( ) ρ( ) I for some θ nθ +δ. Lemma 4. For he gradien algorihm (6) or leas-squares algorihm (8) (9), if φ () is PE, hen * lim θ( ) θ. = 34
35 Discussion: Wha is PE propery of he regressor φ ( ) : φ () = [{ C ω ()}, ω () ], where () n ω, () n ω and for a Hurwiz marix A λ : ω () = A ω () + bu(), ω () = ω () + by(). m λ Aλ PE of φ ( ) PE of ω () and ω () PE of u ( ) and y. ( ) () is a linear sysem PE of y ( ) is deermined by he inpu u! ( ) PE of u ( ) PE of φ ( ) (ha we already observed in he example). 35
36 Example Plan: y = ay+ bu, a =.5, b = and u ( ) = sin( ). Gradien algorihm: γ =.5 y θ b u θ.5 a 5 5 Leas-squares algorihm: P = I 5 5 b y u θ θ a ω u () = sin() y () =α sin( +β ) ω i() =α isin( +β i) due o () = ω () + u(), ω () = ω () + y() φ () = [ ω (), ω ()] ϕ () = [cos(),sin()] PE. 36
37 b. Robusness of adapive algorihms Before he noise free case wih d ( ) = and v ( ) = has been considered for :{ x = A( θ) x+ B( θ) u+ d; Σl y = Cx+ Du+ v. Wha happens if d () or v ()? (only he case d ( ) will be considered) Example Plan: y = ay+ bu+ d( ), a =.5, b = and u ( ) = sin( ), d ( ) =.5sin(3 ). (6) 3 b (8) (9) y θ y u θ u a θ θ b a. 5 V.. V σ φ () is PE Robusness!!! 37
38 u () = e cos() (6).5.5 (8) (9).5 y θ y u θ u θ θ V. V.8.6 σ u () = sin(), d () =.5sin() 3 (6) (8) (9) y u θ θ b a y u θ θ 3 b a. 5 Conclusion: V.. 3 V he disurbance can seriously modify he sysem behavior. σ
39 Linear parameric model wih modeling errors: * y () = φ () θ +δ(),, where * n θ θ is an unknown parameer vecor, φ() θ is a known regressor, y ( ) n is a measured oupu, δ( ) n Le θ() θ be he esimae of represens sysem modeling errors: δ( ) c φ ( ) + c, c >, c >. * θ and define he esimaion error ε () =φ() θ() y() =φ () θ () +δ(),, where * () = () is he parameric error. θ θ θ Modified gradien algorihm (6): φ() θ () = ε () Γ + Γf () m (), θ( ) = θ, m () = +κφ() φ (), κ>,, () where Γ = Γ > is a design marix gain, f ( ) θ is he modificaion erm for robusness. n 39
40 Sabiliy & robusness analysis for nonlinear sysems Lyapunov funcion heory V ( ) θ = θ Γ θ, V ε ε δ () () () = + +θ f () m () m () Noe: δ( ) c φ ( ) + c c c c + + m () +κφ( ) φ( ) κ m () κ c. hen V m () κ m () m () and ( ) c c ε ε() c + c ε() m () κ m () + m () m () κ m () he simples modificaion: ε() c c ε() () θ f, V θ f (). φ() f () = f () s, f () if () / () / / (), s = ε m c κ + c m m () ε () oherwise. V. 4
41 he simples modificaion: φ() f () = f () s, f ()if () / () / / (), s() = ε ε m < c κ + c m V. m () oherwise. A dead zone modificaion: φ() ε() if ε () / m() < c f () = f () d, / κ + c / m(), fd () = m () [ cm ( )/ κ+ c] sign[ ε( )] oherwise. V. φ() θ () = Γ [ ε() f ()] d m () ε ε f s ( ε) ε f d ( ε) σ-modificaion: f () = σθ () φ() θ () = σγθ() Γ ε() m () θ () L. ε 4
42 Projecion: assume ha he se of admissible values for * n * θ is given, i.e. θ Ω= { θ θ : θ M}, M >. Projecion has o ensure ha θ ( ) Ω for all, herefore f () φ() if θ( ) < M or θ( ) = M and θ( ) Γ ε( ), m () = Γθ() θ() φ() Γ ε() oherwise. θ() Γθ() m() θ Inside he circle doing nohing. On an aemp o exi he circle. * θ θ θ = M 4
43 he properies: boundedness of θ ( ), θ () and ε ( ) / m( ) (belong o L ); ε ()/ m() and θ ROBUSNESS! () belong o L ; in he noise-free case ( d ( ) = ) he qualiy is preserved? ESIMAION? Example Plan: y = ay+ bu+ d( ), a =.5, b = and u () = u () = e cos() ; (6) wih γ =..5 y u.5.5 θ θ.5 b a d () =.5sin(.3) 3 y u θ θ b a 43
44 Dead zone algorihm:.5 θ θ θ θ.5 b a a nx ( ) nx ( ) θ θ, b, x σ-modificaion (σ =.): Projecion (M =.5): θ θ.5.5 b a θ a nx ( ) nx ( ) θ θ, b, x θ d()=.5 sin(.3) θ.5 θ θ θ.5 b a a nx ( ) nx ( ) θ.5 θ, b, x 44
45 Dead zone algorihm: b θ.8 θ θ θ.6.4. a a nx () nx () θ θ, b, x σ-modificaion (σ =.):.5 θ θ θ θ.5 b a a nx ( ) nx ( ) θ d()= θ, b, x Projecion (M =.5):.5 θ θ θ b a θ.5 a nx ( ) nx ( ) θ θ, b, x 45
46 SUMMARY. Adapive parameer esimaion: a. Parameerized sysem model * y () =φ() θ. b. Linear parameric model ε () =φ() θ() y() =φ() θ (), φ() c. Normalized gradien algorihm θ () = ε() Γ m (). *. θ() = θ() θ d. Normalized leas-squares algorihm P() φ() θ () = ε(), m () () φ() φ() () P () = P P. m () e. Discree-ime version of adapive algorihms.. Idenificaion and robusness: f. Parameric convergence and PE (PE convergence/esimaion robusness). g. Robusness of adapive algorihms (robusness esimaion). 46
47 Example Oscillaing pendulum: ϕ f, d ϕ [ ππ, ) is he pendulum angle, f is he (conrolling or exciing) inpu applied o he suppor, d is he disurbance influencing he suppor also. Nonlinear model: y = ω sin( y) ρ y + bcos( y) f( ) + d( ), (3) y = ϕ [ ππ, ) is he measured angle, y and y are he angle velociy and acceleraion; ρ > is an unknown fricion coefficien, ω> is an unknown naural frequency, b > is an unknown conrol gain. 3 unknown parameers + nonlineariy. Define u = sin( y) and u = cos( y) u: y+ρ y = ω u () + bu () + d() () for n =, m = and a vecor u = [ u, u]. 47
48 Define he polynomials: Ps () = s + ps, p = ρ; Z() s = z, = ω ; Z() s = z, = b, hen he noise-free model (3) has he form Ps ()[ y]() = Z()[ s u]() + Z( s)[ u](). Parameerizaion for Λ () s = s +λ s+λ : Ps () Z() s Z() s [ y ]() = [ u ]() + [ u ]() Λ() s Λ() s Λ() s Λ() s P() s Z() s Z() s ( )[ y]( ) + [ y]( ) = [ u]( ) + [ u]( ) Λ() s Λ() s Λ() s Λ() s Λ() s P() s Z() s Z() s * y () = [ y]() + [ u]() + [ u]() y () =φ() θ, Λ() s Λ() s Λ() s he parameerized sysem model for y () = y () λ Λ ()[ s y](), φ ( ) = s [ y]( ), [ u ]( ), [ u]( ) = [ ω,, ω,, ω,] Λ() s Λ() s Λ() s ω () = Aλω () + by(), ω () = A ω () + bu (), ω = ω + λ λ () Aλ () bu(), λ λ * = λ ρ ω A =, b =. θ [,, b] and, = λω, y () y () (), 48
49 ω=, ρ =., b =.5, f ( ) = sin(3 ), λ =, λ =, γ =. d () = d ( ) =.5sin(.3 ) ϕ' ϕ' ϕ ϕ θ θ θ 3 b λ ρ ω Normalized gradien algorihm θ θ θ 3 b 3 λ ρ ω λ ρ 3 θ θ θ 3 b ω Dead zone modificaion θ θ θ 3 b λ ρ ω
50 4. INDIREC ADAPIVE CONROL Adjusmen of conrol parameers: direc (from an adapive conrol law/lyapunov analysis); indirec (from adapive esimaes of he sysem parameers). Indirec adapive conrol design: ) adapive esimaion of he plan parameers; ) calculaion of conrol parameers. u C(θ с ) P m (θ * ) Adapive parameer esimaion y θ c () Conrol parameer derivaion θ () he main seps: ) adapive esimaion algorihm design; ) reference model selecion; 3) conroller srucure consrucion; 4) conroller parameer calculaion; 5) sabiliy and robusness analysis. a. Model reference conrol 5
51 Example Plan: y = ay+ bu+ d. Adapive esimaion algorihm ( * [ *, * θ = θ θ ] = [ b, a] ): ε() ω () θ () = γ m () ω(), ω m () = +ω () +ω (), () = ω () + u(), ω () = ω () + y(), A λ =, b =. Reference model: y m = amym + bmr( ) where r ( ) is he reference signal o be racked, a > (he reference model is sable). Conroller srucure: Conroller parameer calculaion: u = b [( a am ) y+ bmr ] y = amy+ bmr + d. c c u =θ y+θ r, c m a m c b m θ =θ ( θ ), θ =θ. Division on θ projecion modificaion of he adapaion algorihm: ε() ω () f() θ if θ () > bmin or θ () = bmin and ε() ω(), () = γ + m () ω(), f() = γε ( ) ω ( ) m( ) oherwise. b min > is he low bound for b, i.e. b bmin. 5
52 a =.5, b =, a =, b =, b min =. m m.5 y u r 5 5 θ θ.5 d () = a b y u r 5 5 θ θ a d () =.5sin(3) y u r 5 5 θ θ.5 d ( ) =.5sin(.3 ) a 5
53 he general procedure: Ps ()[ y]() = k Zs ()[]() u + d (),, (4) p y (), u ( ) are he measured oupu and inpu as before; n n n Ps ( ) = s + p s ps+ p, m m m Z() s = s + z s z s+ z, k p, p i, i =, n and z j, j =, m are he unknown bu consan parameers. Assumpion. he consan Assumpion. k k > and sign( k ) are given. Necessary. p min k kp k ; pi pi pi, i =, n ; zj zj zj, j =, m. Desired. p ) Adapive esimaion algorihm design: Zs () Λ() s Ps () y () = kp [ u]() + [ y](), Λ() s Λ() s n n n Λ () s = s +λ s λ s+λ * y () = θ φ(), * = kpz kpzm kp λ p λn pn Cm = [ Im+, m+ n m ], θ [,...,,,,..., ], φ () = [{ C mω ()}, ω () ], ( ) ( ) ω () = Aλω () + bu(), ω () = A ω () + by(). λ (5) 53
54 Normalized gradien algorihm wih projecion (assumpion ): θ () = g() + f (), θ() = θ,, (6) φ() g() = ε() Γ, () () ε = θ φ() y(), m () = +κφ() φ (), m () Properies: f k () if θ k <θ k() < θk or θ k() = θk and gk() or =, k =, n θ k() = θk and gk(), θ. gk ( ) oherwise, ) Reference model selecion: θ (), θ (), ε( ) / m( ) L and θ (), ε()/ m() L. P ()[ s y ]() = r(), (7) m m where Pm () s is a sable polynomial of degree n m and r ( ) is a bounded and piecewise coninuous reference inpu signal. 54
55 3) Conroller srucure consrucion: c c c c c c 3 4 u () =ω () θ +ω () θ +θ y () +θ r (), (8) where θ c n, θ c n, θ3 c, θ c 4 are he conroller parameers, c as () c as () n ω () = [ u](), ω () = [ y](), as ( ) = [, s,..., s ], Λ () s Λ () s c n c n c c n and Λ c() s = s +λ s λ s+λ is a sable polynomial. A varian of realizaion: c c c c ω () = Aλω () + b u(), c A c c c c λ = c ω () = Aλω, b = () + b y(),. c c c c λ λ λn 3 λn c r () c θ 4 u () d () Ps ()[ y]() = k Zs ()[ u]() + d () p y () θ c ω c () as () Λc () s c θ ω c () as () Λc () s (5) θ 3 c 55
56 he conroller parameer equaion: c c c c 3 c p c p 4 m as () θ Ps () + [() as θ +θ Λ ()] s k Zs () =Λ ()[ s Ps () k θ ZsP () ()] s. (9) Muliply (9) on y ( ) and subsiue (4) for he case d ( ) = : c c c 3 c p c c p 4 c m as () θ Ps ()[ y]() + [() as θ +θ Λ ()] s k Zs ()[ y]() = =Λ () s P()[ s y]() k θ Λ () s Z() s P ()[ s y](), c c c p 3 c p c c p p 4 c m as () θ k Zs ()[]() u + [() as θ +θ Λ ()] s k Zs ()[ y]() = =Λ () skzs ()[]() u kθ Λ () szsp () ()[ s y](). Now divide boh sides on Λ () s k Z() s ( Z( s ) and Λ () are sable polynomials): c p c s c c c 3 as () θ as () θ +θ Λ () [ ]() c s c u + [ y]() = u() θ4pm ( s)[ y](), Λ () s Λ () s c c Subsiuion of he conrol (8) gives c c 4 m 4 c c c c c c m ω () θ +ω () θ +θ y() = u() θ P ( s)[ y](). c c θ P ( s)[ y]() =θ r() θ 4Pm()[ s y]() =θ 4Pm()[ s ym]() Pm( s){[ y]( ) [ ym]( )} =. 56
57 4) Conroller parameer calculaion: c 4 k p θ = Bs () =Λ ()[ s Ps () ZsP () ()] s, hen (9) akes he form: c m c c c 3 as () θ Ps () + [() as θ +θ Λ ()] s k Zs () = Bs (). he righ hand side is a polynomial of degree n wih coefficiens linearly dependen on θ c, θ c and θ 3 c. he lef hand side is a polynomial of degree n wih consan coefficiens. c p Equaing he coefficiens wih he same powers of s we obain he soluion: c c c θ =Θ( pn,..., p; zm,..., z; λn,..., λ ), θ =Θ( n,..., λ ), θ 3 =Θ( n,..., λ ) p p Example : c * n θ =Θ ( θ ; λ,..., λ ), c * n θ =Θ ( θ ; λ,..., λ ), c a m c b m θ =θ ( θ ), θ =θ. heorem. Under assumpion and ha all zeros of Z() s are sable: c * 3 n θ =Θ ( θ ; λ,..., λ ). (i) y, ( ) θ ( ), θ (), ω (), ω () L ; (ii) y () ym() L, lim [ y () ym()] =. 57
58 he pole placemen equaion: b. Pole placemen conrol A * () s = C() s Q() s P() s + D() s Z() s, () where A * () s is he desired polynomial of he closed loop sysem; Cs ( ) and Ds ( ) are polynomials of he pole placemen conrol: c c c u () = { Λ ( s) CsQs ( ) ( )} Λ ( s)[ u]() + Ds () Λ ( s)[ r y](), () where r ( ) is a bounded and piecewise coninuous reference inpu signal, Q( s)[ r]( ) = (a) r ( ) = Qs () = ; (b) r ( ) = c Qs () = s; (c) r ( ) = ce a Qs () = s+ a, a >. According o () he conrol is a dynamical sysem: CsQs () ()[]() u = Ds ()[ r y](). () n n Conroller srucure ( a ( s) = [, s,..., s θ + ] ): c c c c c 3 u () =θ a() sλ ()[]() s u +θ a() sλ ()[ s y r]() +θ {() y r ()}. 58
59 Properies: ) muliplying boh sides of () on y ( ) we obain: * A ()[ s y ]() = C () s Q () s P ()[ s y ]() + D () s Z ()[ s y ]() = = CsQsPs ( ) ( ) ( )[ y]( ) + Zs ( ){ Ds ( )[ r]( ) CsQs ( ) ( )[ u]( )} = = Z() s D()[](). s r (3) r () L and A is sable y () L. ) muliplying boh sides of () on u ( ) we obain: * * A ()[]() s u = C () s Q () s P ()[]() s u + D () s Z ()[]() s u = = P() s D()[ s r y]() + D() s Z()[]() s u = P() s D()[](). s r r () L and * A is sable u () L. 3) using () (3) we ge: A * ()[ s y r]() = lim { y () r ()} =. Assumpion 3. QsPs () () and Z( s ) are coprime. heorem. Under assumpion 3 all signals are bounded and lim [ () ()] y r =. 59
60 SUMMARY Direc adapive conrol Indirec adapive conrol Srucure + Parameerizaion + Resricions (minimum phase) u C(θ с ) P m ( θ * c) Adapive parameer adjusmen y θ c () u C(θ с ) P m (θ * ) Adapive parameer esimaion y θ c () Conrol parameer derivaion θ() Cerainy equivalence 6
61 Example Indirec adapive conrol Robus conrol Plan: y = ay+ bu+ d. Assumpion: < a a, < b b + a >, r ( ) =. m Normalized gradien descen algorihm wih projecion. Robus conrol: u = ky, k = min{ b ( a a m ),}. a =.5, b =, a =.5, b =., a = 5, d ( ) =, v ( ) =. m y a y r.6 u a y m.4 u r
62 a =, d ( ) =, v ( ) =. m y a y r.6 u a 4 y m.4 u r a =, d ( ) = 5sin(5 ), v ( ) =. m 5 y a y r.5 u a y m u r 5.5 a =, d ( ) =, v () =.sin(). m y a y r y m u a u r
63 5. ADAPIVE OBSERVERS A nonlinear sysem in sae space presenaion: x = Ax+ B( y) u+ φ( y), y = Cx, (4) n x, m u, p y are he sae, he inpu (conrol) and he measurable oupu; A, C are consan and known, he funcions By ( ) and φ( y ) are coninuous and known. Everyhing is known excep he sae x (i is no measurable) he sae observer design: x = Ax+ B( y) u+ φ( y) + L[ y Cx], x is he esimae of x; L is he observer marix gain, Assumpion. x (), u () for all. L L A LC is Hurwiz. he esimaion error e= x x : e = x x = { Ax+ B( y) u+ φ( y)} { Ax + B( y) u + φ( y) + L[ y Cx]} = [ A LC] e. he marix A LC is Hurwiz (design of L) x () L, lim [ x() x()] =. 63
64 A nonlinear sysem wih parameric uncerainy: q x = Ax+ B( y) u+ φ( y) + G( y, u) θ, y = Cx, (5) θ is he vecor of unknown parameers, Gyu (, ) is a known coninuous funcion. he adapive observer: x = Ax+ B( y) u+ φ( y) + L[ y Cx] + G( y, u) θ Ωθ, (6) Ω = [ A LC] Ω Gyu (, ), (7) θ = γω C [ y Cx], γ >, (8) q θ is he esimae of θ, n q Ω is an auxiliary filer variable. he sae esimaion error e= x x : e = [ A LC] e+ G( y, u)[ θ θ] + Ωθ. A LC is Hurwiz + Properies of θ ( ) and θ () Properies of e ( ). 64
65 he auxiliary error δ = e + Ωθ [ θ ]: δ = e + Ωθ [ θ] Ωθ= = {[ A LC] e+ G( y, u)[ θ θ] + Ωθ} + {[ A LC] Ω Gyu (, )}[ θ θ] Ωθ= [ A LC] δ. A LC is Hurwiz δ (), lim δ ( ). L = A LC is Hurwiz + y (), u () (assumpion ) Ω (). he parameer esimaion error θ () = θ θ () : θ = θ=γω C [ y Cx] =γ Ω C Ce=γΩ C C[ δ Ωθ ]. L Inuiion: lim δ ( ) θ = γh() h() θ, () () h = Ω C for big enough. = Assumpion. h ( ) is PE: ρ >, δ> : h()() τ h τ dτ ρi n, δ. L q L Assumpion θ (), lim θ ( ) + properies of δ ( ) e (), lim e ( ). L = L = heorem. Under assumpions and all signals in (5) (8) are bounded and lim [ x() x()] =, lim [ θ( ) θ] =. 65
66 Example Oscillaing pendulum: y = ω sin( y) ρ y + bcos( y) f( ) + d( ), (3) y = ϕ [ ππ, ) is he measured angle, y and y are he angle velociy and acceleraion; ρ > is an known fricion coefficien, ω> is an unknown naural frequency, b > is an unknown conrol gain. Presenaion in he form (5) for x = ρ ω + = y, x x = x, y = x, x x sin( x ) bcos( x ) u( ). = y, u = f and d ( ) = : A = ρ, G ( yu, ) = sin( y) cos( y) u, Boh assumpions are saisfied for his example. C =, B ( y ) =, ϕ ( y) =, θ = ω b. 66
67 ω=, ρ =., b =.5, f ( ) = sin(3 ), L = [,], γ =..4.5 d () = ϕ'. θ θ.5 ω b ϕ d () =.5sin() ϕ'. θ θ.5 ω b ϕ d () =.5sin(6) ϕ'. θ θ.5 ω b ϕ
68 INDIREC ADAPIVE CONROL OULINE. Inroducion a. Main properies b. Running example. Adapive parameer esimaion a. Parameerized sysem model b. Linear parameric model c. Normalized gradien algorihm d. Normalized leas-squares algorihm e. Discree-ime version of adapive algorihms 3. Idenificaion and robusness a. Parameric convergence and persisency of exciaion b. Robusness of adapive algorihms 4. Indirec adapive conrol a. Model reference conrol b. Pole placemen conrol 5. Adapive observers 68
( ) ( t) ( 0) ( ) dw w. = = β. Then the solution of (1.1) is easily found to. wt = t+ t. We generalize this to the following nonlinear differential
Periodic oluion of van der Pol differenial equaion. by A. Arimoo Deparmen of Mahemaic Muahi Iniue of Technology Tokyo Japan in Seminar a Kiami Iniue of Technology January 8 9. Inroducion Le u conider a
Διαβάστε περισσότεραUniversity of Washington Department of Chemistry Chemistry 553 Spring Quarter 2010 Homework Assignment 3 Due 04/26/10
Universiy of Washingon Deparmen of Chemisry Chemisry 553 Spring Quarer 1 Homework Assignmen 3 Due 4/6/1 v e v e A s ds: a) Show ha for large 1 and, (i.e. 1 >> and >>) he velociy auocorrelaion funcion 1)
Διαβάστε περισσότερα3 Frequency Domain Representation of Continuous Signals and Systems
3 Frequency Domain Represenaion of Coninuous Signals and Sysems 3. Fourier Series Represenaion of Periodic Signals............. 2 3.. Exponenial Fourier Series.................... 2 3..2 Discree Fourier
Διαβάστε περισσότερα( ) ( ) ( ) Fourier series. ; m is an integer. r(t) is periodic (T>0), r(t+t) = r(t), t Fundamental period T 0 = smallest T. Fundamental frequency ω
Fourier series e jm when m d when m ; m is an ineger. jm jm jm jm e d e e e jm jm jm jm r( is periodi (>, r(+ r(, Fundamenal period smalles Fundamenal frequeny r ( + r ( is periodi hen M M e j M, e j,
Διαβάστε περισσότεραReservoir modeling. Reservoir modelling Linear reservoirs. The linear reservoir, no input. Starting up reservoir modeling
Reservoir modeling Reservoir modelling Linear reservoirs Paul Torfs Basic equaion for one reservoir:) change in sorage = sum of inflows minus ouflows = Q in,n Q ou,n n n jus an ordinary differenial equaion
Διαβάστε περισσότεραAppendix. The solution begins with Eq. (2.15) from the text, which we repeat here for 1, (A.1)
Aenix Aenix A: The equaion o he sock rice. The soluion egins wih Eq..5 rom he ex, which we reea here or convenience as Eq.A.: [ [ E E X, A. c α where X u ε, α γ, an c α y AR. Take execaions o Eq. A. as
Διαβάστε περισσότεραΕΡΓΑΣΙΑ ΜΑΘΗΜΑΤΟΣ: ΘΕΩΡΙΑ ΒΕΛΤΙΣΤΟΥ ΕΛΕΓΧΟΥ ΦΙΛΤΡΟ KALMAN ΜΩΥΣΗΣ ΛΑΖΑΡΟΣ
ΑΡΙΣΤΟΤΕΛΕΙΟ ΠΑΝΕΠΙΣΤΗΜΙΟ ΘΕΣΣΑΛΟΝΙΚΗΣ ΤΜΗΜΑ ΜΑΘΗΜΑΤΙΚΩΝ ΜΕΤΑΠΤΥΧΙΑΚΟ ΠΡΟΓΡΑΜΜΑ ΣΠΟΥΔΩΝ ΘΕΩΡΗΤΙΚΗ ΠΛΗΡΟΦΟΡΙΚΗ ΚΑΙ ΘΕΩΡΙΑ ΣΥΣΤΗΜΑΤΩΝ & ΕΛΕΓΧΟΥ ΕΡΓΑΣΙΑ ΜΑΘΗΜΑΤΟΣ: ΘΕΩΡΙΑ ΒΕΛΤΙΣΤΟΥ ΕΛΕΓΧΟΥ ΦΙΛΤΡΟ KALMAN ΜΩΥΣΗΣ
Διαβάστε περισσότεραNecessary and sufficient conditions for oscillation of first order nonlinear neutral differential equations
J. Mah. Anal. Appl. 321 (2006) 553 568 www.elsevier.com/locae/jmaa Necessary sufficien condiions for oscillaion of firs order nonlinear neural differenial equaions X.H. ang a,, Xiaoyan Lin b a School of
Διαβάστε περισσότερα9.1 Introduction 9.2 Lags in the Error Term: Autocorrelation 9.3 Estimating an AR(1) Error Model 9.4 Testing for Autocorrelation 9.
9.1 Inroducion 9.2 Lags in he Error Term: Auocorrelaion 9.3 Esimaing an AR(1) Error Model 9.4 Tesing for Auocorrelaion 9.5 An Inroducion o Forecasing: Auoregressive Models 9.6 Finie Disribued Lags 9.7
Διαβάστε περισσότεραLinear singular perturbations of hyperbolic-parabolic type
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Number 4, 3, Pages 95 11 ISSN 14 7696 Linear singular perurbaions of hyperbolic-parabolic ype Perjan A. Absrac. We sudy he behavior of soluions
Διαβάστε περισσότερα16. 17. r t te 2t i t 1. 18 19 Find the derivative of the vector function. 19. r t e t cos t i e t sin t j ln t k. 31 33 Evaluate the integral.
SECTION.7 VECTOR FUNCTIONS AND SPACE CURVES.7 VECTOR FUNCTIONS AND SPACE CURVES A Click here for answers. S Click here for soluions. Copyrigh Cengage Learning. All righs reserved.. Find he domain of he
Διαβάστε περισσότεραFourier transform of continuous-time signals
Fourier ransform of coninuous-ime signals Specral represenaion of non-periodic signals Fourier ransform: aperiodic signals repeiion of a finie-duraion signal x()> periodic signals. x x T x kt x kt k k
Διαβάστε περισσότεραThe Euler Equations! λ 1. λ 2. λ 3. ρ ρu. E = e + u 2 /2. E + p ρ. = de /dt. = dh / dt; h = h( T ); c p. / c v. ; γ = c p. p = ( γ 1)ρe. c v.
hp://www.nd.ed/~gryggva/cfd-corse/ The Eler Eqaions The Eler Eqaions The Eler eqaions for D flow: + + p = x E E + p where Define E = e + / H = h + /; h = e + p/ Gréar Tryggvason Spring 3 Ideal Gas: p =
Διαβάστε περισσότεραLecture 12 Modulation and Sampling
EE 2 spring 2-22 Handou #25 Lecure 2 Modulaion and Sampling The Fourier ransform of he produc of wo signals Modulaion of a signal wih a sinusoid Sampling wih an impulse rain The sampling heorem 2 Convoluion
Διαβάστε περισσότεραNonlinear Analysis: Modelling and Control, 2013, Vol. 18, No. 4,
Nonlinear Analysis: Modelling and Conrol, 23, Vol. 8, No. 4, 493 58 493 Exisence and uniqueness of soluions for a singular sysem of higher-order nonlinear fracional differenial equaions wih inegral boundary
Διαβάστε περισσότεραVol. 40 No Journal of Jiangxi Normal University Natural Science Jul. 2016
4 4 Vol 4 No 4 26 7 Journal of Jiangxi Normal Universiy Naural Science Jul 26-5862 26 4-349-5 3 2 6 2 67 3 3 O 77 9 A DOI 6357 /j cnki issn-5862 26 4 4 C q x' x /q G s = { α 2 - s -9 2 β 2 2 s α 2 - s
Διαβάστε περισσότεραOscillation criteria for two-dimensional system of non-linear ordinary differential equations
Elecronic Journal of Qualiaive Theory of Differenial Equaions 216, No. 52, 1 17; doi: 1.14232/ejqde.216.1.52 hp://www.mah.u-szeged.hu/ejqde/ Oscillaion crieria for wo-dimensional sysem of non-linear ordinary
Διαβάστε περισσότεραStatistical Inference I Locally most powerful tests
Statistical Inference I Locally most powerful tests Shirsendu Mukherjee Department of Statistics, Asutosh College, Kolkata, India. shirsendu st@yahoo.co.in So far we have treated the testing of one-sided
Διαβάστε περισσότερα6.003: Signals and Systems
6.3: Signals and Sysems Modulaion December 6, 2 Communicaions Sysems Signals are no always well mached o he media hrough which we wish o ransmi hem. signal audio video inerne applicaions elephone, radio,
Διαβάστε περισσότεραJ. of Math. (PRC) u(t k ) = I k (u(t k )), k = 1, 2,, (1.6) , [3, 4] (1.1), (1.2), (1.3), [6 8]
Vol 36 ( 216 ) No 3 J of Mah (PR) 1, 2, 3 (1, 4335) (2, 4365) (3, 431) :,,,, : ; ; ; MR(21) : 35A1; 35A2 : O17529 : A : 255-7797(216)3-591-7 1 d d [x() g(, x )] = f(, x ),, (11) x = ϕ(), [ r, ], (12) x(
Διαβάστε περισσότεραUniform Convergence of Fourier Series Michael Taylor
Uniform Convergence of Fourier Series Michael Taylor Given f L 1 T 1 ), we consider the partial sums of the Fourier series of f: N 1) S N fθ) = ˆfk)e ikθ. k= N A calculation gives the Dirichlet formula
Διαβάστε περισσότεραOscillation Criteria for Nonlinear Damped Dynamic Equations on Time Scales
Oscillaion Crieria for Nonlinear Damped Dynamic Equaions on ime Scales Lynn Erbe, aher S Hassan, and Allan Peerson Absrac We presen new oscillaion crieria for he second order nonlinear damped delay dynamic
Διαβάστε περισσότεραExample Sheet 3 Solutions
Example Sheet 3 Solutions. i Regular Sturm-Liouville. ii Singular Sturm-Liouville mixed boundary conditions. iii Not Sturm-Liouville ODE is not in Sturm-Liouville form. iv Regular Sturm-Liouville note
Διαβάστε περισσότεραω = radians per sec, t = 3 sec
Secion. Linear and Angular Speed 7. From exercise, =. A= r A = ( 00 ) (. ) = 7,00 in 7. Since 7 is in quadran IV, he reference 7 8 7 angle is = =. In quadran IV, he cosine is posiive. Thus, 7 cos = cos
Διαβάστε περισσότεραOther Test Constructions: Likelihood Ratio & Bayes Tests
Other Test Constructions: Likelihood Ratio & Bayes Tests Side-Note: So far we have seen a few approaches for creating tests such as Neyman-Pearson Lemma ( most powerful tests of H 0 : θ = θ 0 vs H 1 :
Διαβάστε περισσότεραManaging Production-Inventory Systems with Scarce Resources
Managing Producion-Invenory Sysems wih Scarce Resources Online Supplemen Proof of Lemma 1: Consider he following dynamic program: where ḡ (x, z) = max { cy + E f (y, z, D)}, (7) x y min(x+u,z) f (y, z,
Διαβάστε περισσότεραAnti-aliasing Prefilter (6B) Young Won Lim 6/8/12
ni-aliasing Prefiler (6B) Copyrigh (c) Young W. Lim. Permission is graned o copy, disribue and/or modify his documen under he erms of he GNU Free Documenaion License, Version. or any laer version published
Διαβάστε περισσότεραMatrices and Determinants
Matrices and Determinants SUBJECTIVE PROBLEMS: Q 1. For what value of k do the following system of equations possess a non-trivial (i.e., not all zero) solution over the set of rationals Q? x + ky + 3z
Διαβάστε περισσότερα6.003: Signals and Systems. Modulation
6.3: Signals and Sysems Modulaion December 6, 2 Subjec Evaluaions Your feedback is imporan o us! Please give feedback o he saff and fuure 6.3 sudens: hp://web.mi.edu/subjecevaluaion Evaluaions are open
Διαβάστε περισσότερα4.6 Autoregressive Moving Average Model ARMA(1,1)
84 CHAPTER 4. STATIONARY TS MODELS 4.6 Autoregressive Moving Average Model ARMA(,) This section is an introduction to a wide class of models ARMA(p,q) which we will consider in more detail later in this
Διαβάστε περισσότερα= e 6t. = t 1 = t. 5 t 8L 1[ 1 = 3L 1 [ 1. L 1 [ π. = 3 π. = L 1 3s = L. = 3L 1 s t. = 3 cos(5t) sin(5t).
Worked Soluion 95 Chaper 25: The Invere Laplace Tranform 25 a From he able: L ] e 6 6 25 c L 2 ] ] L! + 25 e L 5 2 + 25] ] L 5 2 + 5 2 in(5) 252 a L 6 + 2] L 6 ( 2)] 6L ( 2)] 6e 2 252 c L 3 8 4] 3L ] 8L
Διαβάστε περισσότεραCHAPTER 25 SOLVING EQUATIONS BY ITERATIVE METHODS
CHAPTER 5 SOLVING EQUATIONS BY ITERATIVE METHODS EXERCISE 104 Page 8 1. Find the positive root of the equation x + 3x 5 = 0, correct to 3 significant figures, using the method of bisection. Let f(x) =
Διαβάστε περισσότεραSection 8.3 Trigonometric Equations
99 Section 8. Trigonometric Equations Objective 1: Solve Equations Involving One Trigonometric Function. In this section and the next, we will exple how to solving equations involving trigonometric functions.
Διαβάστε περισσότερα8. The Normalized Least-Squares Estimator with Exponential Forgetting
Lecure 5 8. he Normalized Leas-Squares Esimaor wih Expoeial Forgeig his secio is devoed o he mehod of Leas-Squares wih expoeial forgeig ad ormalizaio. Expoeial forgeig of daa is a very useful echique i
Διαβάστε περισσότεραEE512: Error Control Coding
EE512: Error Control Coding Solution for Assignment on Finite Fields February 16, 2007 1. (a) Addition and Multiplication tables for GF (5) and GF (7) are shown in Tables 1 and 2. + 0 1 2 3 4 0 0 1 2 3
Διαβάστε περισσότεραApproximation of the Lerch zeta-function
Approximaion of he Lerch zea-funcion Ramūna Garunkši Deparmen of Mahemaic and Informaic Vilniu Univeriy Naugarduko 4 035 Vilniu Lihuania ramunagarunki@mafvul Abrac We conider uniform in parameer approximaion
Διαβάστε περισσότεραReminders: linear functions
Reminders: linear functions Let U and V be vector spaces over the same field F. Definition A function f : U V is linear if for every u 1, u 2 U, f (u 1 + u 2 ) = f (u 1 ) + f (u 2 ), and for every u U
Διαβάστε περισσότεραCRASH COURSE IN PRECALCULUS
CRASH COURSE IN PRECALCULUS Shiah-Sen Wang The graphs are prepared by Chien-Lun Lai Based on : Precalculus: Mathematics for Calculus by J. Stuwart, L. Redin & S. Watson, 6th edition, 01, Brooks/Cole Chapter
Διαβάστε περισσότεραA Simple Version of the Lucas Model
Aricle non publié May 11, 2007 A Simple Version of he Lucas Model Mazamba Tédie Absrac This discree-ime version of he Lucas model do no include he physical capial. We inregrae in he uiliy funcion he leisure
Διαβάστε περισσότεραNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 12 Periodic data A function g has period P if g(x + P ) = g(x) Model: Trigonometric polynomial of order M T M (x) =
Διαβάστε περισσότεραOrdinal Arithmetic: Addition, Multiplication, Exponentiation and Limit
Ordinal Arithmetic: Addition, Multiplication, Exponentiation and Limit Ting Zhang Stanford May 11, 2001 Stanford, 5/11/2001 1 Outline Ordinal Classification Ordinal Addition Ordinal Multiplication Ordinal
Διαβάστε περισσότεραA New Approach to Bounded Real Lemma Representation for Linear Neutral Systems
46-57 388 4 3 3 sariai@ee.knu. ac.ir agira@knu. ac.ir 3 labibi@knu. ac.ir (388// 388/9/8 :. -..... :. A New Approac o Boune Real Lemma Represenaion for Linear Neural Sysems Ala Sariai, Hami Reza agira
Διαβάστε περισσότεραEvery set of first-order formulas is equivalent to an independent set
Every set of first-order formulas is equivalent to an independent set May 6, 2008 Abstract A set of first-order formulas, whatever the cardinality of the set of symbols, is equivalent to an independent
Διαβάστε περισσότεραThe canonical 2nd order transfer function is expressed as. (ω n
Second order ransfer funcions nd Order ransfer funcion - Summary of resuls The canonical nd order ransfer funcion is expressed as H(s) s + ζ s + is he naural frequency; ζ is he damping coefficien. The
Διαβάστε περισσότεραST5224: Advanced Statistical Theory II
ST5224: Advanced Statistical Theory II 2014/2015: Semester II Tutorial 7 1. Let X be a sample from a population P and consider testing hypotheses H 0 : P = P 0 versus H 1 : P = P 1, where P j is a known
Διαβάστε περισσότεραJesse Maassen and Mark Lundstrom Purdue University November 25, 2013
Notes on Average Scattering imes and Hall Factors Jesse Maassen and Mar Lundstrom Purdue University November 5, 13 I. Introduction 1 II. Solution of the BE 1 III. Exercises: Woring out average scattering
Διαβάστε περισσότερα2 Composition. Invertible Mappings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan Composition. Invertible Mappings In this section we discuss two procedures for creating new mappings from old ones, namely,
Διαβάστε περισσότερα3.4 SUM AND DIFFERENCE FORMULAS. NOTE: cos(α+β) cos α + cos β cos(α-β) cos α -cos β
3.4 SUM AND DIFFERENCE FORMULAS Page Theorem cos(αβ cos α cos β -sin α cos(α-β cos α cos β sin α NOTE: cos(αβ cos α cos β cos(α-β cos α -cos β Proof of cos(α-β cos α cos β sin α Let s use a unit circle
Διαβάστε περισσότεραPractice Exam 2. Conceptual Questions. 1. State a Basic identity and then verify it. (a) Identity: Solution: One identity is csc(θ) = 1
Conceptual Questions. State a Basic identity and then verify it. a) Identity: Solution: One identity is cscθ) = sinθ) Practice Exam b) Verification: Solution: Given the point of intersection x, y) of the
Διαβάστε περισσότεραSecond Order RLC Filters
ECEN 60 Circuits/Electronics Spring 007-0-07 P. Mathys Second Order RLC Filters RLC Lowpass Filter A passive RLC lowpass filter (LPF) circuit is shown in the following schematic. R L C v O (t) Using phasor
Διαβάστε περισσότεραThe Student s t and F Distributions Page 1
The Suden s and F Disribuions Page The Fundamenal Transformaion formula for wo random variables: Consider wo random variables wih join probabiliy disribuion funcion f (, ) simulaneously ake on values in
Διαβάστε περισσότεραHomework 3 Solutions
Homework 3 Solutions Igor Yanovsky (Math 151A TA) Problem 1: Compute the absolute error and relative error in approximations of p by p. (Use calculator!) a) p π, p 22/7; b) p π, p 3.141. Solution: For
Διαβάστε περισσότεραOn local motion of a general compressible viscous heat conducting fluid bounded by a free surface
ANNALE POLONICI MAHEMAICI LIX.2 (1994 On local moion of a general compressible viscous hea conducing fluid bounded by a free surface by Ewa Zadrzyńska ( Lódź and Wojciech M. Zaja czkowski (Warszawa Absrac.
Διαβάστε περισσότεραderivation of the Laplacian from rectangular to spherical coordinates
derivation of the Laplacian from rectangular to spherical coordinates swapnizzle 03-03- :5:43 We begin by recognizing the familiar conversion from rectangular to spherical coordinates (note that φ is used
Διαβάστε περισσότεραMath221: HW# 1 solutions
Math: HW# solutions Andy Royston October, 5 7.5.7, 3 rd Ed. We have a n = b n = a = fxdx = xdx =, x cos nxdx = x sin nx n sin nxdx n = cos nx n = n n, x sin nxdx = x cos nx n + cos nxdx n cos n = + sin
Διαβάστε περισσότεραAPPENDIX A DERIVATION OF JOINT FAILURE DENSITIES
APPENDIX A DERIVAION OF JOIN FAILRE DENSIIES I his Appedi we prese he derivaio o he eample ailre models as show i Chaper 3. Assme ha he ime ad se o ailre are relaed by he cio g ad he sochasic are o his
Διαβάστε περισσότεραLecture 6. Goals: Determine the optimal threshold, filter, signals for a binary communications problem VI-1
Lecue 6 Goals: Deemine e opimal esold, file, signals fo a binay communicaions poblem VI- Minimum Aveage Eo Pobabiliy Poblem: Find e opimum file, esold and signals o minimize e aveage eo pobabiliy. s s
Διαβάστε περισσότερα6.1. Dirac Equation. Hamiltonian. Dirac Eq.
6.1. Dirac Equation Ref: M.Kaku, Quantum Field Theory, Oxford Univ Press (1993) η μν = η μν = diag(1, -1, -1, -1) p 0 = p 0 p = p i = -p i p μ p μ = p 0 p 0 + p i p i = E c 2 - p 2 = (m c) 2 H = c p 2
Διαβάστε περισσότεραANSWERSHEET (TOPIC = DIFFERENTIAL CALCULUS) COLLECTION #2. h 0 h h 0 h h 0 ( ) g k = g 0 + g 1 + g g 2009 =?
Teko Classes IITJEE/AIEEE Maths by SUHAAG SIR, Bhopal, Ph (0755) 3 00 000 www.tekoclasses.com ANSWERSHEET (TOPIC DIFFERENTIAL CALCULUS) COLLECTION # Question Type A.Single Correct Type Q. (A) Sol least
Διαβάστε περισσότεραSCHOOL OF MATHEMATICAL SCIENCES G11LMA Linear Mathematics Examination Solutions
SCHOOL OF MATHEMATICAL SCIENCES GLMA Linear Mathematics 00- Examination Solutions. (a) i. ( + 5i)( i) = (6 + 5) + (5 )i = + i. Real part is, imaginary part is. (b) ii. + 5i i ( + 5i)( + i) = ( i)( + i)
Διαβάστε περισσότεραECE Spring Prof. David R. Jackson ECE Dept. Notes 2
ECE 634 Spring 6 Prof. David R. Jackson ECE Dept. Notes Fields in a Source-Free Region Example: Radiation from an aperture y PEC E t x Aperture Assume the following choice of vector potentials: A F = =
Διαβάστε περισσότεραHOMEWORK 4 = G. In order to plot the stress versus the stretch we define a normalized stretch:
HOMEWORK 4 Problem a For the fast loading case, we want to derive the relationship between P zz and λ z. We know that the nominal stress is expressed as: P zz = ψ λ z where λ z = λ λ z. Therefore, applying
Διαβάστε περισσότεραFourier Series. MATH 211, Calculus II. J. Robert Buchanan. Spring Department of Mathematics
Fourier Series MATH 211, Calculus II J. Robert Buchanan Department of Mathematics Spring 2018 Introduction Not all functions can be represented by Taylor series. f (k) (c) A Taylor series f (x) = (x c)
Διαβάστε περισσότεραThe choice of an optimal LCSCR contract involves the choice of an x L. such that the supplier chooses the LCS option when x xl
EHNIA APPENDIX AMPANY SIMPE S SHARIN NRAS Proof of emma. he choice of an opimal SR conrac involves he choice of an such ha he supplier chooses he S opion hen and he R opion hen >. When he selecs he S opion
Διαβάστε περισσότεραConcrete Mathematics Exercises from 30 September 2016
Concrete Mathematics Exercises from 30 September 2016 Silvio Capobianco Exercise 1.7 Let H(n) = J(n + 1) J(n). Equation (1.8) tells us that H(2n) = 2, and H(2n+1) = J(2n+2) J(2n+1) = (2J(n+1) 1) (2J(n)+1)
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότερα6. MAXIMUM LIKELIHOOD ESTIMATION
6 MAXIMUM LIKELIHOOD ESIMAION [1] Maximum Likelihood Estimator (1) Cases in which θ (unknown parameter) is scalar Notational Clarification: From now on, we denote the true value of θ as θ o hen, view θ
Διαβάστε περισσότερα9.09. # 1. Area inside the oval limaçon r = cos θ. To graph, start with θ = 0 so r = 6. Compute dr
9.9 #. Area inside the oval limaçon r = + cos. To graph, start with = so r =. Compute d = sin. Interesting points are where d vanishes, or at =,,, etc. For these values of we compute r:,,, and the values
Διαβάστε περισσότεραis the home less foreign interest rate differential (expressed as it
The model is solved algebraically, excep for a cubic roo which is solved numerically The mehod of soluion is undeermined coefficiens The noaion in his noe corresponds o he noaion in he program The model
Διαβάστε περισσότερα5. Choice under Uncertainty
5. Choice under Uncertainty Daisuke Oyama Microeconomics I May 23, 2018 Formulations von Neumann-Morgenstern (1944/1947) X: Set of prizes Π: Set of probability distributions on X : Preference relation
Διαβάστε περισσότεραSolution Series 9. i=1 x i and i=1 x i.
Lecturer: Prof. Dr. Mete SONER Coordinator: Yilin WANG Solution Series 9 Q1. Let α, β >, the p.d.f. of a beta distribution with parameters α and β is { Γ(α+β) Γ(α)Γ(β) f(x α, β) xα 1 (1 x) β 1 for < x
Διαβάστε περισσότεραApproximation of distance between locations on earth given by latitude and longitude
Approximation of distance between locations on earth given by latitude and longitude Jan Behrens 2012-12-31 In this paper we shall provide a method to approximate distances between two points on earth
Διαβάστε περισσότερα6.3 Forecasting ARMA processes
122 CHAPTER 6. ARMA MODELS 6.3 Forecasting ARMA processes The purpose of forecasting is to predict future values of a TS based on the data collected to the present. In this section we will discuss a linear
Διαβάστε περισσότεραSecond Order Partial Differential Equations
Chapter 7 Second Order Partial Differential Equations 7.1 Introduction A second order linear PDE in two independent variables (x, y Ω can be written as A(x, y u x + B(x, y u xy + C(x, y u u u + D(x, y
Διαβάστε περισσότεραExercises 10. Find a fundamental matrix of the given system of equations. Also find the fundamental matrix Φ(t) satisfying Φ(0) = I. 1.
Exercises 0 More exercises are available in Elementary Differential Equations. If you have a problem to solve any of them, feel free to come to office hour. Problem Find a fundamental matrix of the given
Διαβάστε περισσότεραC.S. 430 Assignment 6, Sample Solutions
C.S. 430 Assignment 6, Sample Solutions Paul Liu November 15, 2007 Note that these are sample solutions only; in many cases there were many acceptable answers. 1 Reynolds Problem 10.1 1.1 Normal-order
Διαβάστε περισσότεραSpace-Time Symmetries
Chapter Space-Time Symmetries In classical fiel theory any continuous symmetry of the action generates a conserve current by Noether's proceure. If the Lagrangian is not invariant but only shifts by a
Διαβάστε περισσότεραBounding Nonsplitting Enumeration Degrees
Bounding Nonsplitting Enumeration Degrees Thomas F. Kent Andrea Sorbi Università degli Studi di Siena Italia July 18, 2007 Goal: Introduce a form of Σ 0 2-permitting for the enumeration degrees. Till now,
Διαβάστε περισσότεραDifferentiation exercise show differential equation
Differentiation exercise show differential equation 1. If y x sin 2x, prove that x d2 y 2 2 + 2y x + 4xy 0 y x sin 2x sin 2x + 2x cos 2x 2 2cos 2x + (2 cos 2x 4x sin 2x) x d2 y 2 2 + 2y x + 4xy (2x cos
Διαβάστε περισσότεραForced Pendulum Numerical approach
Numerical approach UiO April 8, 2014 Physical problem and equation We have a pendulum of length l, with mass m. The pendulum is subject to gravitation as well as both a forcing and linear resistance force.
Διαβάστε περισσότεραInverse trigonometric functions & General Solution of Trigonometric Equations. ------------------ ----------------------------- -----------------
Inverse trigonometric functions & General Solution of Trigonometric Equations. 1. Sin ( ) = a) b) c) d) Ans b. Solution : Method 1. Ans a: 17 > 1 a) is rejected. w.k.t Sin ( sin ) = d is rejected. If sin
Διαβάστε περισσότεραAreas and Lengths in Polar Coordinates
Kiryl Tsishchanka Areas and Lengths in Polar Coordinates In this section we develop the formula for the area of a region whose boundary is given by a polar equation. We need to use the formula for the
Διαβάστε περισσότεραΑπόκριση σε Μοναδιαία Ωστική Δύναμη (Unit Impulse) Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο. Απόστολος Σ.
Απόκριση σε Δυνάμεις Αυθαίρετα Μεταβαλλόμενες με το Χρόνο The time integral of a force is referred to as impulse, is determined by and is obtained from: Newton s 2 nd Law of motion states that the action
Διαβάστε περισσότεραNew bounds for spherical two-distance sets and equiangular lines
New bounds for spherical two-distance sets and equiangular lines Michigan State University Oct 8-31, 016 Anhui University Definition If X = {x 1, x,, x N } S n 1 (unit sphere in R n ) and x i, x j = a
Διαβάστε περισσότεραTRM +4!5"2# 6!#!-!2&'!5$27!842//22&'9&2:1*;832<
TRM!"#$%& ' *,-./ *!#!!%!&!3,&!$-!$./!!"#$%&'*" 4!5"# 6!#!-!&'!5$7!84//&'9&:*;83< #:4
Διαβάστε περισσότεραLecture 2. Soundness and completeness of propositional logic
Lecture 2 Soundness and completeness of propositional logic February 9, 2004 1 Overview Review of natural deduction. Soundness and completeness. Semantics of propositional formulas. Soundness proof. Completeness
Διαβάστε περισσότεραarxiv: v1 [math.ap] 10 Apr 2017
C 1,θ -Esimaes on he disance of Inerial Manifolds José M. Arriea and Esperanza Sanamaría arxiv:1704.03017v1 [mah.ap] 10 Apr 2017 Absrac: In his paper we obain C 1,θ -esimaes on he disance of inerial manifolds
Διαβάστε περισσότεραThe Simply Typed Lambda Calculus
Type Inference Instead of writing type annotations, can we use an algorithm to infer what the type annotations should be? That depends on the type system. For simple type systems the answer is yes, and
Διαβάστε περισσότεραHMY 220: Σήματα και Συστήματα Ι
HMY 220: Σήματα και Συστήματα Ι ΔΙΑΛΕΞΗ #3 Ιδιάζοντα σήματα Βασικές κατηγορίες συστημάτων Διασυνδέσεις συστημάτων Ιδιάζοντα σήματα (singular signals) Τα ιδιάζοντα σήματα είναι σήματα τα οποία είναι ιδεατά
Διαβάστε περισσότεραNowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in
Nowhere-zero flows Let be a digraph, Abelian group. A Γ-circulation in is a mapping : such that, where, and : tail in X, head in : tail in X, head in A nowhere-zero Γ-flow is a Γ-circulation such that
Διαβάστε περισσότεραOn Strong Product of Two Fuzzy Graphs
Inernaional Journal of Scienific and Research Publicaions, Volume 4, Issue 10, Ocober 014 1 ISSN 50-3153 On Srong Produc of Two Fuzzy Graphs Dr. K. Radha* Mr.S. Arumugam** * P.G & Research Deparmen of
Διαβάστε περισσότερα1 String with massive end-points
1 String with massive end-points Πρόβλημα 5.11:Θεωρείστε μια χορδή μήκους, τάσης T, με δύο σημειακά σωματίδια στα άκρα της, το ένα μάζας m, και το άλλο μάζας m. α) Μελετώντας την κίνηση των άκρων βρείτε
Διαβάστε περισσότεραKey Formulas From Larson/Farber Elementary Statistics: Picturing the World, Second Edition 2002 Prentice Hall
64_INS.qxd /6/0 :56 AM Page Key Formulas From Larson/Farber Elemenary Saisics: Picuring he World, Second Ediion 00 Prenice Hall CHAPTER Class Widh = round up o nex convenien number Maximum daa enry - Minimum
Διαβάστε περισσότεραw o = R 1 p. (1) R = p =. = 1
Πανεπιστήµιο Κρήτης - Τµήµα Επιστήµης Υπολογιστών ΗΥ-570: Στατιστική Επεξεργασία Σήµατος 205 ιδάσκων : Α. Μουχτάρης Τριτη Σειρά Ασκήσεων Λύσεις Ασκηση 3. 5.2 (a) From the Wiener-Hopf equation we have:
Διαβάστε περισσότεραOn shift Harnack inequalities for subordinate semigroups and moment estimates for Lévy processes
Available online a www.sciencedirec.com ScienceDirec Sochasic Processes and heir Applicaions 15 (15) 3851 3878 www.elsevier.com/locae/spa On shif Harnack inequaliies for subordinae semigroups and momen
Διαβάστε περισσότεραBayesian statistics. DS GA 1002 Probability and Statistics for Data Science.
Bayesian statistics DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Frequentist vs Bayesian statistics In frequentist
Διαβάστε περισσότεραSection 7.6 Double and Half Angle Formulas
09 Section 7. Double and Half Angle Fmulas To derive the double-angles fmulas, we will use the sum of two angles fmulas that we developed in the last section. We will let α θ and β θ: cos(θ) cos(θ + θ)
Διαβάστε περισσότεραMultiple positive periodic solutions of nonlinear functional differential system with feedback control
J. Mah. Anal. Appl. 288 (23) 819 832 www.elsevier.com/locae/jmaa Muliple posiive periodic soluions of nonlinear funcional differenial sysem wih feedback conrol Ping Liu and Yongkun Li Deparmen of Mahemaics,
Διαβάστε περισσότεραLifting Entry (continued)
ifting Entry (continued) Basic planar dynamics of motion, again Yet another equilibrium glide Hypersonic phugoid motion Planar state equations MARYAN 1 01 avid. Akin - All rights reserved http://spacecraft.ssl.umd.edu
Διαβάστε περισσότεραFractional Colorings and Zykov Products of graphs
Fractional Colorings and Zykov Products of graphs Who? Nichole Schimanski When? July 27, 2011 Graphs A graph, G, consists of a vertex set, V (G), and an edge set, E(G). V (G) is any finite set E(G) is
Διαβάστε περισσότερα