SINGLE OUTPUT DEPENDENT QUADRATIC OBSERVABILITY NORMAL FORM
|
|
- Amos Curtis
- 6 years ago
- Views:
Transcription
1 SINGLE OUTPUT DEPENDENT QUADRATIC OBSERVABILITY NORMAL FORM G Zheng D Boutat JP Barbot INRIA Rhône-Alpes, Inovallée, 655 avenue de l Europe, Montbonnot Sant Martn, St Ismer Cedex, France LVR/ENSI, Boulevard de Lahtolle, 8 Bourges, France ECS/ENSEA, 6 Avenue du Ponceau, 954 Cergy-Pontose, France, Projet ALIEN-INRIA Futures Abstract: In ths paper, two quadratc observablty normal forms dependent on output respectvely correspondent to drft domnant term forced domnant term are frstly dscussed Moreover characterstc numbers are studed n order to smplfy the calculaton of these two normal forms INTRODUCTION Normal form s a powerful tool to analyze the propertes of dynamcal systems, such as stablty (Poncaré et al, 899), controllablty (Kang et al, 99) In, ths concept was frstly ntroduced n (Boutat-Baddas et al, ) n order to analyze the observablty of dynamcal system, n whch the quadratc observablty normal form was studed the nterests of ths technque was hghlghted In 5, a new observablty normal form dependent on ts output was studed n (Zheng et al, 5), the necessary suffcent condtons were proposed Moreover, an extenson to mult-outputs case has also been analyzed n (Boutat et al, 6) Snce the observablty normal form dependent on ts output (or outputs) were exactly lnear, another reasonable extenson based on the work of (Boutat-Baddas et al, ) (Chabraou et al, 3) s the study of quadratc observablty normal form dependent on ts output (or outputs) Therefore, n ths paper, we consder the followng sngle nput sngle output system: ζ D IR n, u IR, f : IR n IR n, g : IR n IR n h : IR n IR are analytc functons, assume that for all ζ D, we have rank [ dh, dl f h,, dl f h T = n As an extenson of our work n (Zheng et al, 5), f the theorem n (Zheng et al, 5) s not verfed, we assume that system () can be transformed nto the followng form : η = β(y) A(y)η γ y [ ( η) B(y)u ϑ y ( η)u O y [3 ( η, u) y = Cη η IR n, η = [η, η T, γ [ y ( η) = [γ [ y ( η),, γ [ y n ( η) T, ϑ y ( η) = [ϑ y ( η),, ϑ y n ( η) T, for n, γ y [ ( η) ϑ y ( η) are functon of η wth order respectvely parameterzed by y, β(y) = [β (y),, β n(y) T, α (y) A(y) =, α (y) () ζ = f(ζ) g(ζ)u y = h(ζ) () The necessary suffcent condton for ths transformaton s stll an open queston
2 B(y) s defned as follows: B(y) = ( b(y),,, ) T (3) Assume that z = x φ [ y, hence ż = ẋ φ[ Accordng to equaton (4) (5), we have y ẋ x As t was shown n (Boutat-Baddas et al, ) that the equvalence modulo an output njecton s justfed by the fact that the output njecton can be canceled n the observaton error dynamcs Therefore, by an output njecton β(y), system () s equvalent modulo an output njecton to the followng system ẋ = A(y)x γ y [ B(y)u ϑ y u O y [3 ( x, u) (4) y = x n = Cx x = [x,, x T Our problem s how to characterze the fact that all the quadratc terms can be canceled by a dffeomorphsm? If ths knd of dffeomorphsm does not exst, then what s ts normal form ts resonant terms? QUADRATIC EQUIVALENCE MODULO AN OUTPUT INJECTION Defnton System (4) s quadratcally equvalent to system ż = A(y)z γ y [ ( z) B(y)u y ( z)u O y [3 ( z, u) (5) y = Cz f there exsts a dffeomorphsm of the followng form: z = x φ [ y (6) whch transforms the quadratc term γ y [ nto another quadratc term γ y [ ( z), φ [ y = [φ [ y,,, φ[ y,n T φ [ y, are the homogenous polynomals wth order n z Remark ) In order to keep the output unchanged, we choose the output equal to x n, whch means the dffeomorphsm z = x φ [ y should verfy φ [ = ) It should be noted that ths choce s not oblgatory In fact, we can also choose φ [ = φ [ (y), e, a functon of the output Proposton System (4) s quadratcally equvalent to system (5) modulo an output njecton, f only f the followng homologc equatons are satsfed: γ y [ Γ [ y = A(y)φ [ y γ y [ ϑ y φ[ y b(y) = x Γ [ [ y = φ [ y x α (y),, y φ [ y α n (y),, x x (7) ż = [ φ[ y x ( = A(y) x φ [ y B(y)u [ A(y)x γ y [ B(y)u ϑ y u O y [3 ( x, u) ) γ y [ ( x φ [ y ) y u O [3 y ( x, u) So we obtan γ y [ φ[ y x ϑ y φ[ y B(y) = x A(y)x = A(y)φ [ y γ [ y y φ [ y A(y)x [ x φ [ = y φ [ y α (y),, x y = Γ [ y O y [3 α (y),, fnally equaton (8) becomes: γ y [ Γ [ y = A(y)φ [ y γ y [ ϑ y φ[ y b(y) = y x 3 QUADRATIC OBSERVABILITY NORMAL FORM DEPENDENT ON ITS OUTPUT Snce there exst two quadratc terms n system (5): γ y [ ( z) y ( z)u, we wll study two normal form whch correspond respectvely to the drft term forced term n ths secton 3 Normal form wth drft domnant term In ths subsecton, we study the normal form correspondent to drft domnant term by smplfyng the quadratc term γ y [ ( z) Theorem Normal form correspondent to drft domnant term system (5) by quadratcally equvalent modulo an output njecton s n the followng normal form: c (y)ξ h j (y)ξ ξ j j ξ = u c (y)ξ c n (y)ξ x (8) A(y)ξ B(y)u O y [3 ( ξ, u) (9)
3 Snce the objectve of ths normal form s to make γ y [ =, so the frst homologc equaton n (7) becomes Defne γ [ y Γ [ y = A(y)φ [ y φ [ y = [φ [,, φ [ T, γ y [ = [γ y, [,, γ y, [ n T, ϑ y = [ ϑ,, ϑ T, φ [ y n = And we obtan n α (y)φ [ = γ y, [ [ φ y, α (y)x x α n (y)φ [ [ = γ y, [ n φ [ α (y)x x α (y)φ [ = γ y, [ n () the frst lne of equaton (7) gves n γ y, [ [ φ x α (y) = () x Equaton () can be used to deduce φ [ y, n order to cancel the quadratc terms from γ y, [ to γ y, [ n respectvely Moreover, f γ y, [ φ [ y, verfy also equaton (), then ths system can be quadratcally lnearzable Otherwse, t gves the followng resonant terms: Wth ϑ n γ y, [ α (y) φ[ y, x x y φ[ y ϑ Assume b(y) = x y, we have = = c n (y)x ϑ = c n (y)x, then c n (y) = cn (y) And t s not possble to cancel other components Hence we obtan normal form (9) In order to hghlght the proposed method, we consder the followng example Example Consder the followng system: ( ) ẋ = x ( x 3 x x x 3 x x 3 4x 3 x x 4 3 ) ( x u ẋ = x 3 x x 3 x x 3 x x 3 ) x u ẋ 3 = x 3 x x 3 x u y = x 3 () y Accordng to equaton (), we have φ [ y,3 = α (y)φ [ y, = γ y [,3 α (y)φ [ = γ y [, α (y) φ[ y, x x } z = x x 3 x we obtan z = x Hence the quadratc z 3 = x 3 resonant terms are: γ y, [ α (y) φ[ x = x x x 3 x Fnally we have the followng normal form: ( ż = z z 3 z z 3 4z3 z z3 ) 4 z u O y [3 (z (, z, u) ) ż = z 3 z z 3 z z3 z [3 u O y (z, z, u) ż 3 = z 3 z z3 z u O y [3 (z, z, u) y = z 3 3 Normal form wth forced domnant term (3) Ths subsecton s devoted to study another normal form by smplfyng quadratc terms: y ( z)u, n system (5) Theorem Normal form forced domnant term of system (5) by quadratcally equvalent modulo an output njecton s n the followng form: d (y)ξ ξ j j ξ d ξ = (y)ξ u c n (y)ξ (4) ξ d n (y)ξ A(y)ξ B(y)u O y [3 ( ξ, u) Assumng φ [ =, we have f we set then we obtan ϑ = ϑ y φ[ y b(y) = (5) x = = = Accordng to the frst homologc equaton n (7), γ [ y Γ [ y = A(y)φ [ y γ [ y (6) we obtan γ y, [ = γ y, [ γ [ y, α (y)φ [ n [ φ x α (y) x = γ y, [ n γ y, [ α n (y)φ [ [ φ [ y, x α (y)x [ = γ y, [ n φ [ α (y)x x γ [ α (y)φ [ = γ [ From equaton (5), the term φ [ y can be used to cancel all the quadratc terms form the second lne
4 to the last one, except for the terms x d j x, j [, n, hence we obtan: j γ y [ = ( d (y)x x j, x d (y)x,, x d n (y)x Fnally we have the normal form (4) The followng example s to llustrate the proposed normal form Example (Example contnue) Accordng to the above method, by smple calculaton, we have z = x x 3 x x3 3 x x x 3 x z = x x x x 3 x (7) z 3 = x 3 wth ths dffeomorphsm we have the followng normal form: ( ż = z3) 4 z z3 z z 3u O y [3 ( (z, z, u) ż = z 3 z z 3 z3) z z3 4 z z O y [3 (z, z, u) (8) ż 3 = z 3 z z 3 z z z3 z z 3 z u O y [3 (z, z, u) y = z 3 4 CHARACTERISTIC NUMBERS In order to smplfy the calculaton of dffeomorphsm proposed before, a new method wll be proposed n ths secton whch permt us to determne the dffeomorphsm (6) n a easer way, wth whch we need not to solve the homologc equaton (7) 4 Characterstc numbers for normal form wth drft domnant term In order to smplfy equaton (7), we assume: φ [ y, = x T φ y, x, γ y, [ = x T γ y, x, γ y, [ = x T γ y, x, φ φ y, := (y) φ, (y) φ, (y) φ, (y), γ (y) γ, (y) γ y, := γ, (y) γ, (y), γ (y) γ, (y) γ y, := γ, (y) γ, (y) ) T We obtan Γ [ y = [Γ [,, Γ [ T Γ [ y, = x T Γ y, x Γ y, = ĀT (y)φ y, φ y, Ā(y), α (y) Ā(y) := α n (y) Settng A(y)φ [ y := x T φ yx, for all x, homologc equaton (7) can be wrtten as follows: And we have x T γ yx x T Γ yx = x T φyx x T γ yx Because A(y)φ [ y = γ y Γ y = φ y γ y (9) f γ y =, we can cancel all the quadratc terms n system (4) α (y)φ [ f γ y [ =, then α (y)φ [ φ y, γ y, φ y, γ y, φ y, φ y, ĀT (y) γ y,n ( φ y,n φ y,n ) T =, α (y)φ y,,, α (y)φ y, Ā(y) we have γ y, ĀT (y)φ y, φ y, Ā(y) = α (y)φ y, = γ y, ĀT (y)φ y, φ y, Ā(y), for n Fnally, by recurrence, we get k [ C k (ĀT ) k j j (y) (y) γy,kāj j= φ y, = k k= α m m= () for n, Cj k denotes the combnatoral coeffcent Wth ths dffeomorphsm, accordng to the followng equalty: ϑ y φ[ b(y) = x ϑ y,n = Settng then c n j (y) = cn j (y) y ϑ = c n j (y)x j, = j= c n j (y)x j, j= y we have
5 Because ϑ y φ[ b(y) = x y ϑ y, = c j (y)x j, y, = j= y, assumng c j (y)x j j= then, snce φ [ y, = x T φ y, x, we obtan: c j (y) = c j (y) b(y)φ,j (y), c n j (y) = cn j (y) () for, j n Defnton We defne the characterstc matrx for system (4) as follows: M y = γ y, ĀT (y)φ y, φ y, Ā(y) () c (y) c (y) C y = (3) c n (y) cn (y) M y C y are only functon of y We are now able to set the followng theorem Theorem 3 Normal form correspondent to drft domnant term of system (5) s as follows: M y ξ = ξ T ξ A(y)ξ B(y)u C yξu O [3 y ( ξ, u) M y s defned n () (4) Remark ) M y(, j) n equaton (4) depends on coeffcents h j (y) of equaton (9) as follows: M y(, j) = M y(j, ) = h j(y), < j M y(, ) = h (y) ) there are 3n(n )/ characterstc numbers n the normal form Example 3 (Example contnue) Wth the gude of the computaton process proposed above, we have ( ) M y = γ y, ĀT (y)φ y, φ y, Ā(y) = x 3 ( ) 4x 3 x 4 3 C y = x 3 x 3 Fnally we get the x 3 same normal form correspondent to drft domnant term n (3) 4 Characterstc numbers for normal form wth forced domnant term Wth the same argument, n order to smplfy equaton (7), settng ϑ = c n j (y)x j, = j= c n j (y)x j, j= c n j (y) = cn j (y) (5) Snce ϑ y φ[ b(y) = x y, φ (y) φ, (y) φ [ y, = x T φ, (y) φ, (y) x, y f we set φ,j (y) = c j (y), we obtan b(y) = = = Then we have γ y Γ y = φ y γ y, whch gves γ y, Ā(y)φy, φā(y) = γ γ y, α (y)φ y, = γ y, ĀT (y)φ y, φ y, Ā(y) for n Defnng Υ (y) Υ, (y) Υ y, = Υ, (y) Υ, (y) = [ k C k k j γ y,k j (y) Ā γ (y) j= y,k k= k α m m= (6) Ῡ (y) Ῡ, (y) Ῡ y, = (7) Ῡ, (y) Ῡ, (y) k [ C k k j j (y) (y) γy,kāj j= = k k= α m m= Because φ,j (y) = c j (y),, j [, n, f we set b(y) φ l,s (y) = Ῡ l,s (y), [, n, l, s [, n we have γ l,s =, [, n, l, s [, n Hence we get the followng dffeomorphsm: φ φ y, :,j (y) = c j (y),, j [, n b(y) φ l,s (y) = Ῡ l,s (y), [, n, l, s [, n
6 Because we have γ l,s =, [, n, l, s [, n, then γ,j, [, n, j [, n can be determned by the followng equaton: we note φ,j (y) = c j (y) b(y) = Υ,j (y) M yk (, j) = M yk (j, ) = for j n k n γ k,j, =,, n, (8) Fnally because γ y, Ā(y)φ φā(y) = γy,, we obtan: M y, (, j) = M y, (j, ) = γ,j, < j (9) Then we can gve the followng theorem Theorem 4 Normal form correspondent to forced domnant term of system (5) s as follows: M y, M y, ξ = ξ T ξ u M y,n c n (y)ξ A(y)ξ B(y)u O y [3 ( ξ, u) c n M y, are defned by equatons (5), (8) (9) Remark 3 The number of the free coeffcents s 3n(n )/ Example 4 (Example contnue) Followng the proposed calculaton procedure, we can obtan x3 x 3 3 x 3 φ (y) = x 3 3 x 3, φ (y) =, φ 3 (y) = the followng matrx M y: ( ) x 4 3 M y, = x 3, M y, = x 3 x 3 M y,3 = x 3 whch yelds the same normal form (8) ( ) x3 x 3 x4 3 x 4 3, studed two normal forms respectvely correspondent to the drft domnant term forced domnant term Both representatons are equvalent In order to smplfy the calculaton, we proposed to apply quadratc terms characterstc matrx for these two normal forms REFERENCES Boutat D, Zheng G, Barbot JP Hammour H (6), Observer Error Lnearzaton Mult-Output Dependng, In Proc of IEEE CDC, 6 Boutat-Baddas L, Boutat D, Barbot JP Taulegne R(), Quadratc Observablty normal form, In Proc of IEEE CDC, Chabraou S, Boutat D, Boutat-Baddas L Barbot JP (3), Observablty quadratc characterstc numbers, In Proc of IEEE CDC, 3 Poncaré H (899), Les Méthodes nouvelles de la mécanque céleste, Gauther Vllard, 899 Réedton 987, Bbblothèque scentfque A Blanchard Krener AJ, (984), Approxmate lnearzaton by state feedback coordnate change, Systems Control Letter, 5, 8-85 Krener AJ, Karahan S, Hubbard M Frezza R (987), Hgher order lnear approxmatons to nonlnear control systems, In Proc of IEEE CDC, 987 Krener AJ, Karahan S Hubbard M, (988), Approxmate normal forms of nonlnear systems, In Proc of IEEE CDC, 988 Kang W Krener AJ (99), Extended quadratc controller normal form dynamc state feedback lnearzaton of non lnear systems, SIAM J Control Optmzaton, Vol 3, No 6, pp , 99 Zheng G, Boutat D Barbot JP (5), Output Dependent Observablty Normal Form, In Proc of IEEE CDC, 5 5 CONCLUSION Ths paper s devoted to study the quadratc observablty normal form parameterzed by ts output Above all, two homologc equatons were gven n order to guarantee the equvalence of quadratc transformaton After that, we have
Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationOn simultaneous parameter identification and state estimation for cascade state affine systems
Amercan Control Conference Westn Seattle Hotel, Seattle, Washngton, USA June 11-13, WeAI1.9 On smultaneous parameter dentfcaton and state estmaton for cascade state affne systems M. GHANES, G. ZHENG and
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More informationSupplemental document
Electronc Supplementary Materal (ESI) for Physcal Chemstry Chemcal Physcs. Ths journal s the Owner Socetes 01 Supplemental document Behnam Nkoobakht School of Chemstry, The Unversty of Sydney, Sydney,
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More information9 Characteristic classes
THEODORE VORONOV DIFFERENTIAL GEOMETRY. Sprng 2009 [under constructon] 9 Characterstc classes 9.1 The frst Chern class of a lne bundle Consder a complex vector bundle E B of rank p. We shall construct
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationSolutions to exam in SF1811 Optimization, Jan 14, 2015
Solutons to exam n SF8 Optmzaton, Jan 4, 25 3 3 O------O -4 \ / \ / The network: \/ where all lnks go from left to rght. /\ / \ / \ 6 O------O -5 2 4.(a) Let x = ( x 3, x 4, x 23, x 24 ) T, where the varable
More informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More informationOnline Appendix. t=1 (p t w)q t. Then the first order condition shows that
Artcle forthcomng to ; manuscrpt no (Please, provde the manuscrpt number!) 1 Onlne Appendx Appendx E: Proofs Proof of Proposton 1 Frst we derve the equlbrum when the manufacturer does not vertcally ntegrate
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationGroup Analysis of Ordinary Differential Equations of the Order n>2
Symmetry n Nonlnear Mathematcal Physcs 997, V., 64 7. Group Analyss of Ordnary Dfferental Equatons of the Order n> L.M. BERKOVICH and S.Y. POPOV Samara State Unversty, 4430, Samara, Russa E-mal: berk@nfo.ssu.samara.ru
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationInexact Newton Methods for Inverse Eigenvalue Problems
Inexact Newton Methods for Inverse Egenvalue Problems Zheng-jan Ba Abstract In ths paper, we survey some of the latest development n usng nexact Newton-lke methods for solvng nverse egenvalue problems.
More informationProjective change between two Special (α, β)- Finsler Metrics
Internatonal Journal of Trend n Research and Development, Volume 2(6), ISSN 2394-9333 www.jtrd.com Projectve change between two Specal (, β)- Fnsler Metrcs Gayathr.K 1 and Narasmhamurthy.S.K 2 1 Assstant
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationOn a direct solver for linear least squares problems
ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More informationSalmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2
Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationC4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z )
C4B Machne Learnng Answers II.(a) Show that for the logstc sgmod functon dσ(z) dz = σ(z) ( σ(z)) A. Zsserman, Hlary Term 20 Start from the defnton of σ(z) Note that Then σ(z) = σ = dσ(z) dz = + e z e z
More informationObservers for non-linear differential-algebraic. system
Observers for non-lnear dfferental-algebrac systems Jan Åslund and Erk Frsk Department of Electrcal Engneerng, Lnköpng Unversty 581 83 Lnköpng, Sweden, {jaasl,frsk}@sy.lu.se Abstract In ths paper we consder
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationGELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n
GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of
More informationAppendix for Causal Interaction in Factorial Experiments: Application to Conjoint Analysis
A Appendx for Causal Interacton n Factoral Experments: Applcaton to Conjont Analyss Mathematcal Appendx: Proofs of Theorems A. Lemmas Below, we descrbe all the lemmas, whch are used to prove the man theorems
More information1 Matrix representations of canonical matrices
1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:
More informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationMATH Sensitivity of Eigenvalue Problems
MATH 537- Senstvty of Egenvalue Problems Prelmnares Let A be an n n matrx, and let λ be an egenvalue of A, correspondngly there are vectors x and y such that Ax = λx and y H A = λy H Then x s called A
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationCommunication Complexity 16:198: February Lecture 4. x ij y ij
Communcaton Complexty 16:198:671 09 February 2010 Lecture 4 Lecturer: Troy Lee Scrbe: Rajat Mttal 1 Homework problem : Trbes We wll solve the thrd queston n the homework. The goal s to show that the nondetermnstc
More informationThe proximal average for saddle functions and its symmetry properties with respect to partial and saddle conjugacy
The proxmal average for saddle functons and ts symmetry propertes wth respect to partal and saddle conjugacy Rafal Goebel December 3, 2009 Abstract The concept of the proxmal average for convex functons
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationPerfect Competition and the Nash Bargaining Solution
Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationIntroduction. - The Second Lyapunov Method. - The First Lyapunov Method
Stablty Analyss A. Khak Sedgh Control Systems Group Faculty of Electrcal and Computer Engneerng K. N. Toos Unversty of Technology February 2009 1 Introducton Stablty s the most promnent characterstc of
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationMath 217 Fall 2013 Homework 2 Solutions
Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has
More informationLinear Regression Analysis: Terminology and Notation
ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented
More informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
More informationIn this section is given an overview of the common elasticity models.
Secton 4.1 4.1 Elastc Solds In ths secton s gven an overvew of the common elastcty models. 4.1.1 The Lnear Elastc Sold The classcal Lnear Elastc model, or Hooean model, has the followng lnear relatonshp
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationEstimation: Part 2. Chapter GREG estimation
Chapter 9 Estmaton: Part 2 9. GREG estmaton In Chapter 8, we have seen that the regresson estmator s an effcent estmator when there s a lnear relatonshp between y and x. In ths chapter, we generalzed the
More informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More information= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.
Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and
More informationMATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS
MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples
More informationSELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.
SELECTED SOLUTIONS, SECTION 4.3 1. Weak dualty Prove that the prmal and dual values p and d defned by equatons 4.3. and 4.3.3 satsfy p d. We consder an optmzaton problem of the form The Lagrangan for ths
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationREDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].
REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß
More informationDr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur
Analyss of Varance and Desgn of Exerments-I MODULE III LECTURE - 2 EXPERIMENTAL DESIGN MODELS Dr. Shalabh Deartment of Mathematcs and Statstcs Indan Insttute of Technology Kanur 2 We consder the models
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationZeros and Zero Dynamics for Linear, Time-delay System
UNIVERSITA POLITECNICA DELLE MARCHE - FACOLTA DI INGEGNERIA Dpartmento d Ingegnerua Informatca, Gestonale e dell Automazone LabMACS Laboratory of Modelng, Analyss and Control of Dynamcal System Zeros and
More information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More information