A RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY OF AFFINE SYSTEMS

Size: px
Start display at page:

Download "A RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY OF AFFINE SYSTEMS"

Transcription

1 Доклади на Българската академия на науките Comptes rendus de l Académe bulgare des Scences Tome 60 No SCIENCES ET INGENIERIE Théore des systèmes A RELAXED SUFFICIENT CONDITION FOR ROBUST STABILITY OF AFFINE SYSTEMS Svetoslav Savov Ivan Popchev (Submtted on June ) Abstract A new suffcent condton for robust stablty of lnear tme-nvarant systems s proposed It s based on the proved equvalence between stablty of an augmented system and stablty of the orgnal one Ths helps to solve the problem for the frst system by makng use of certan addtonal matrx varables The suggested approach s less conservatve than the exstng smlar ones whch represent partcular cases of the proposed here suffcent robust stablty condton Key words: uncertan systems robust stablty polynomal Lyapunov functons 1 Introducton Robustness analyss of lnear tme-nvarant systems subjected to parameter uncertanty belongng to some vector set attracts the attenton of the control theory communty for more than three decades In partcular the LMI-based approach has become very promsng snce t admts the usage of parameter-dependent Lyapunov functons As a result less conservatve condtons for robust stablty can be derved (see eg 1 2 ) An LMI approach for robust stablty analyss va Lyapunov functons assocated wth hgher-order state vector dervatves was recently proposed n 3 The objectve of ths paper s to generalze ths approach For the purpose the statespace descrpton of an augmented system s ntroduced It s proved that the stablty of ths system s equvalent to the stablty of the orgnal one The man advantage conssts n the possblty to use some addtonal arbtrary parameter-dependent matrx varables It s shown that the LMI problem can also be convexfed Thus the problem soluton conssts n a check for negatve defnteness of a fnte number of matrces The man result s a suffcent condton for robust stablty whch s proved to be less conservatve than the ones proposed by smlar approaches 2 Prelmnares The followng notatons are used throughout the paper R rq R r H r denote the sets of real r q r r and r r Hurwtz (negatve stable) matrces respectvely and R s the set r 1 real vectors An r q zero block and the r r dentty matrx are denoted 0 rq I r respectvely The set of egenvalues (spectrum) of a square matrx X s σ(x) The set of p n real matrces of rank n p s denoted Z(p n) Some basc for the present research results are gven below Ths work s supported by the Bulgaran Academy of Scences under grant /

2 Theorem 21 The followng statements are equvalent: (a) A H n ; (b) for any gven matrces B Z(p n) and X H p n there exst matrx à H p and nonsngular S R p such that ÃB = BA σ(ã) σ(a) σ(x) B = S B Z(p n) Matrx à s smlar to an upper block trangular matrx wth the off-dagonal block beng arbtrarly chosen; (c) there exsts a postve defnte matrx Π R p such that for any gven B Z(p n) one has L = A T P + P A < 0 P = B T ΠB Proof Let (a) holds and B Z(p n) R R np n and G R p n are arbtrary matrces There exst some p p nonsngular matrces S and T such that S B In In 0 np n = = B T = C C I p n (1) T ÃT 1 A R A RC R = à = 0 p nn (CR + G) CA + GC G Then ÃB = BA B Z(p n) Snce R and G are arbtrary matrces for G = CR X one gets σ(ã) σ(t ÃT 1 ) σ(a) σ(x) e à H p Ths proves (a) (b) Let (b) holds There exsts some postve defnte matrx Π R p such that L = à T Π + Πà < 0 For any B Z(p n) one has 0 > BT LB = A T B T ΠB + B T ΠBA = L whch proves (b) (c) If (c) holds then obvously A H n e (c) (a) Corollary 21 A H n f and only f for any gven matrces B Z(p n) and F Z(m p) there exsts a postve defnte matrx Π R m such that ÃT F T ΠF + F T ΠF à < 0 ÃB = BA Proof It follows from Theorem 21 The followng result s a drect consequence from Corollary 21 Corollary 22 Consder the dynamc systems (2) ẋ = Ax x R n ; (3) µ = õ µ = Bx Rp B Z(p n) ÃB = BA System (2) s asymptotcally stable f and only f for any gven matrces B n (3) and F Z(m p) there exsts a postve defnte matrx Π R m such that v(µ) = µ T F T ΠF µ s a vald Lyapunov functon (VLF) for system (3) e v(µ) > 0 v(µ) < 0 µ 0 If v(µ) s a VLF for system (3) then v(x) = x T B T F T ΠF Bx s VLF for system (2) and vce versa For any nteger f 1 denote m = pf and (4) F = µ = I pã à 2 à f 1 F µ = µ µ (1) µ (2) µ (f 1) = µ 1 µ 2 = ( µ1 µ 1 ) ( ) µ1 E1 0m Π µ (f) E = E Π = 2 Π 0 m 974 S Savov I Popchev

3 where F Z(m p) µ 1 R m µ 2 R 2m µ R m+p E 1 = I m 0 mp E 2 = 0 mp I m E Z(2m m + p) Π R 2m Π R m and µ () denotes the -th total tme dervatve of µ eg µ (1) µ Note that µ 2 = E µ and the total tme dervatve of the canddate for a Lyapunov functon for system (3) s computed as follows: (5) v(µ) = 2µ T F T ΠF µ = 2µ T 1 Π µ 1 = µ T 2 Πµ 2 = µ T E T ΠE µ Defne the followng matrces: bl dag à = Ãd R m U = Ãd I m R m2m and Ā = Āj R mm+p Ā j R p = 1 2 f j = 1 2 f + 1 A = j Ā j = I p j = p otherwse Theorem 22 Consder the followng (m + p) (m + p) symmetrc matrx (6) L = E T ΠE + Ā T K T + KĀ K R m+pm System (2) s asymptotcally stable f and only f for any gven matrces B n (3) and F n (4) there exst a postve defnte matrx Π R m and matrx K such that L n (6) s a negatve defnte matrx Proof Let system (2) be asymptotcally stable For any gven matrces B n (3) and F n (4) there exsts some postve defnte Π R m such that v(µ) = µ T F T ΠF µ s a VLF for system (3) n accordance wth Corollary 2 e à T P + P à = L < 0 P = F T ΠF Consder the matrces K1 K = K R 2mm 2 L = Π+U T KT + KU ÃT = d K1 T + K 1Ãd Π + ÃT d KT 2 K 1 L11 L Π + K 2 à d K1 T (K2 T + K = 12 2) L T 121 L R 2m 22 Let K 1 = Π + ÃT d KT 2 Then L 11 = ÃT d Π + Πà d ÃT d L 22Ãd and L 12 = 0 m For Π = bldag P one has L 11 = bldagl ÃT d L 22Ãd bldagl < 0 There always exsts some approprate matrx K 2 such that L 22 < 0 and L 11 < 0 e L < 0 Snce E Z(2m m + p) and UE = Ā one gets 0 > ET LE = E T ΠE + Ā T K T + KĀ = L K = E T K whch proves the necessty part Let L n (6) be a negatve matrx for some matrces B n (3) F n (4) Π > 0 and K Snce Ā µ = 0 Rm µ 2 = E µ and havng n mnd (5) one has 0 > µ T L µ = µ T (E T ΠE + Ā T K T + KĀ) µ = µt 2 Πµ 2 = v(µ) Ths means that v(µ) = µ T F T ΠF µ s a VLF for system (3) and n accordance wth Corollary 2 v(x) = x T B T F T ΠF Bx s a VLF for system (2) e t s asymptotcally stable Ths proves the suffcency part Comments Theorem 22 proves the equvalence between negatve defnteness of L n (6) and the exstence of matrces B n (3) F n (4) and Π(m) m = pf p n f 1 such that (7) L(m) = ÃT Π(m) + Π(m) à < 0; Π(m) = F T Π(m)F Π(m) > 0 à T B = BA Compt rend Acad bulg Sc 60 No

4 For the partcular case p = n m = nf B = I n (7) becomes (8) L(nf) = A T Π(nf) + Π(nf)A < 0; Π(nf) = F T Π(nf)F Π(nf) > 0 and the condton based on negatve defnteness of the correspondng matrx L n (6) was proposed for f = 2 n 4 and for f 2 n 3 Obvously Corollary 22 and Theorem 22 generalze these results By makng use of Theorem 21 and Corollary 21 one can easly show that nequalty (8) always mples nequalty (7) for arbtrary B Z(p n) p > n and F Z(m p) Therefore the condton proposed by Theorem 22 does not ntroduce any conservatsm for p > n wth respect to the partcular case p = n n the stablty analyss for system (2) 3 Uncertan dynamc systems Consder the set of constant but not exactly known vectors Ω = {α R N : α mn α α max α mn 0 α max = 1 2 N} and the followng uncertan dynamc systems: (9) ẋ = A(α)x x R n A(α) = A 0 + (10) µ = Ã(α)µ µ = B(α)x Rp A(α) RC(α) Ã(α) = C(α)A(α) + G(α)C(α) α A A 0 H n α Ω =1 R G(α) B(α) = I n C(α) where A = 0 1 N are gven constant matrces R R np n C(α) = C 0 + α C R p nn G(α) = G 0 + N α G R p n and R C G = 0 1 N are =1 =1 arbtrary matrces Matrces Ã(α) and B(α) n (10) satsfy the equalty Ã(α)B(α) = B(α)A(α) B(α) Z(p n) Lemma 31 Denote X = C A + G C For any matrx A there exst (a) nteger p > n and real matrces C and G such that X = 0 p nn ; (b) matrces C and G (possbly complex) such that X = 0 p nn for arbtrary p > n Proof (a) Let rank(a ) = r n r = max r = 1 2 N and p n r Consder the sngular value decomposton of matrx A = U Σ V T U R nr V T R r n and Σ R r s a postve dagonal matrx When A s nonsngular then U and V T are n n orthogonal matrces Let Σ V G = C Y Y = U 0 np n r R np n C = T C R C p n r n where C s an arbtrary matrx Then X = C (A Y C ) = 0 p nn Snce A s a real matrx U and V T are also real whch proves asserton (a) for p 2n p > n If p n for any C of rank n and G = C A (C T C ) 1 C T one has also X = 0 p nn (b) Let G = g G where G s some nonsngular matrx Then X = 0 p nn f and 1 only f G C A + g C = 0 p nn whch represents a lnear wth respect to the unknown matrx C equaton and can be put n a compact vector form as K vec(c ) = 0 R n(p n) vec(c ) R n(p n) 976 S Savov I Popchev

5 K = A T 1 G + g I n(p n) K R n(p n) where X Y and vec( ) denote the Kronecker product of matrces X Y and the usual operaton that stacks the columns of the matrx argument ( ) on top of each other respectvely Denote K 1 = A T 1 G It s well known that the spectrum of K 1 s defned as 1 σ(k 1 ) {λ s (A )λ k ( G ) s = 1 2 n k = 1 2 p n} For g = λ σ(k 1 ) matrx K s sngular and vec(c ) 0 s obtaned as an egenvector for ths matrx correspondng to ts zero egenvalue Dependng on the spectrum of A matrces C and G may be real or complex Snce p s arbtrary asserton (b) s proved From Lemma 31 t follows that matrx Ã(α) can always be represented as (111) Ã(α) = Ã0 + (112) α à + =1 j=1 <j α α j à j à = 0 A à = RC 0 np n C 0 A + C A 0 + G 0 C + G C 0 G 0 n 0 np n à j = C A j + C j A + G C j + G jc 0 p n A 0 RC 0 R C 0 A 0 + G 0 C 0 G 0 Remark 1 As far as asymptotcal stablty of system (10) s concerned matrx Ã(α) s Hurwtz only f Ã(0) = Ã0 s Hurwtz snce α = 0 s admssble Havng n mnd matrx à n (1) t follows that σ(ã0) σ(a 0 ) σ( C 0 R G 0 ) By no doubt there always exst matrces C 0 R and G 0 such that Ã0 s Hurwtz for any p > n 4 Robust stablty Consder the matrces n (4) where à = Ã(α) F = F (α) Π = Π(α) Π = Π(α) and matrx (6) wth L = L(α) Ā = Ā(α) Let Γ denotes the set of 2 N vertces of the set Ω The next theorem provdes a suffcent condton for robust stablty of system (9) Theorem 41 Consder (10) Let there exst ntegers p > n f 1 constant matrces R K affne parameter-dependent matrces C(α) G(α) satsfyng C A + G C = 0 = 1 2 N Ã(0) = Ã0 H p and a symmetrc matrx (12) Π(α) = Π 0 + α Π (α) + =1 j=1 <j α α j Π j (α) R m m = pf such that L(α) n (6) s a negatve defnte matrx for all α Γ Then the uncertan system (9) s asymptotcally stable and the polynomal n α VLF of degree d = 2(f +1) gven by (13) v(x α) = x T B T (α)f T (α)π(α)f (α)b(α)x = d d 1 + +d N =0 guarantees ts robust stablty α d 1 1 αd 2 2 αd N N v ( d 1 d 2 d N x) = x T P (α)x Compt rend Acad bulg Sc 60 No

6 Proof Let the above assumpton hold Havng n mnd (6) (11) and (12) one has 0 > f(y α) = y T L(α)y = l00 (y) + α l (y) + =1 y R m+p y 0 α Γ j=1 <j α α j l j (y) Functon f(y α) s multconvex n α and t s negatve on Ω f and only f t takes negatve values for all α Γ Therefore L(α) < 0 α Ω Recall vector µ n (4) Snce 0 > µ T L(α)µ = v(µ) = µ T ÃT (α) P (α) + P (α)ã(α)µ µ 0 α Ω P (α) = F T (α)π(α)f (α) t follows that P (α) s a nonsngular matrx for all α Ω For α = 0 Ω Ã(0) = Ã0 H p by assumpton and obvously P (0) > 0 By contnuty of the egenvalues of P (α) on Ω one has P (α) > 0 α Ω Havng n mnd that µ = B(α)x the above scalar nequalty can be rewrtten as follows: 0 > x T A T (α)p (α) + P (α)a(α)x = v(x α) v(x α) = x T B T (α)f T (α)πf (α)b(α)x > 0 for all nonzero vectors x and uncertan vectors α Ω e system (9) s asymptotcally stable and v(x α) n (13) s a polynomal n α VLF of degree 2(f + 1) guaranteeng ts robust stablty Conclusons A new suffcent robust stablty condton for a class of uncertan systems has been derved The proposed approach generalzes some known results consderng the same problem and s proved to be less conservatve than them REFERENCES 1 Blman P SIAM J Contr And Optmz Ches G AGarull A Tes AVcno Proc Conf on Decson and Contr Hawa USA Ebhara Y DPeaucelle D Arzeler T Hagwara Proc IEEE Conf on Decson and Contr Sevlle Span Olvera M R Skelton Perspectves n Robust Control Lecture Notes n Contr and Informaton Sc 268 Sprnger 2001 Insttute of Informaton Technologes Acad G Bonchev Str Bl Sofa Bulgara 978 S Savov I Popchev

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - 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 information

APPENDIX A Some Linear Algebra

APPENDIX 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 information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.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 information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Control of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design

Control of Uncertain Bilinear Systems using Linear Controllers: Stability Region Estimation and Controller Design Control of Uncertan Blnear Systems usng Lnear Controllers: Stablty Regon Estmaton Controller Desgn Shoudong Huang Department of Engneerng Australan Natonal Unversty Canberra, ACT 2, Australa shoudong.huang@anu.edu.au

More information

Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Introduction. - 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 information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

Solutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.

Solutions 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 information

The Order Relation and Trace Inequalities for. Hermitian Operators

The Order Relation and Trace Inequalities for. Hermitian Operators Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence

More information

Linear Algebra and its Applications

Linear Algebra and its Applications Lnear Algebra and ts Applcatons 4 (00) 5 56 Contents lsts avalable at ScenceDrect Lnear Algebra and ts Applcatons journal homepage: wwwelsevercom/locate/laa Notes on Hlbert and Cauchy matrces Mroslav Fedler

More information

Stability analysis for class of switched nonlinear systems

Stability analysis for class of switched nonlinear systems Stablty analyss for class of swtched nonlnear systems The MIT Faculty has made ths artcle openly avalable. Please share how ths access benefts you. Your story matters. Ctaton As Publshed Publsher Shaker,

More information

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

Deriving the X-Z Identity from Auxiliary Space Method

Deriving the X-Z Identity from Auxiliary Space Method Dervng the X-Z Identty from Auxlary Space Method Long Chen Department of Mathematcs, Unversty of Calforna at Irvne, Irvne, CA 92697 chenlong@math.uc.edu 1 Iteratve Methods In ths paper we dscuss teratve

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

Neuro-Adaptive Design - I:

Neuro-Adaptive Design - I: Lecture 36 Neuro-Adaptve Desgn - I: A Robustfyng ool for Dynamc Inverson Desgn Dr. Radhakant Padh Asst. Professor Dept. of Aerospace Engneerng Indan Insttute of Scence - Bangalore Motvaton Perfect system

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

More information

MATH Homework #2

MATH Homework #2 MATH609-601 Homework #2 September 27, 2012 1. Problems Ths contans a set of possble solutons to all problems of HW-2. Be vglant snce typos are possble (and nevtable). (1) Problem 1 (20 pts) For a matrx

More information

On Finite Rank Perturbation of Diagonalizable Operators

On Finite Rank Perturbation of Diagonalizable Operators Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable

More information

Errors for Linear Systems

Errors 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 information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpenCourseWare http://ocw.mt.edu 6.854J / 18.415J Advanced Algorthms Fall 2008 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms. 18.415/6.854 Advanced Algorthms

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong 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 information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: 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 information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner 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 information

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS

THE GUARANTEED COST CONTROL FOR UNCERTAIN LARGE SCALE INTERCONNECTED SYSTEMS Copyrght 22 IFAC 5th rennal World Congress, Barcelona, Span HE GUARANEED COS CONROL FOR UNCERAIN LARGE SCALE INERCONNECED SYSEMS Hroak Mukadan Yasuyuk akato Yoshyuk anaka Koch Mzukam Faculty of Informaton

More information

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra MEM 255 Introducton to Control Systems Revew: Bascs of Lnear Algebra Harry G. Kwatny Department of Mechancal Engneerng & Mechancs Drexel Unversty Outlne Vectors Matrces MATLAB Advanced Topcs Vectors A

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation

Asymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 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 information

Lecture 5 Decoding Binary BCH Codes

Lecture 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 information

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x MEM633 Lectures 7&8 Chapter 4 Descrptons of MIMO Systems 4- Drect ealzatons y() s s su() s y () s u () s ( s)( s) s y() s u (), s y() s u() s s s y() s u(), s y() s u() s ( s)( s) s () ( s ) y ( s) u (

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

9 Characteristic classes

9 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 information

A property of the elementary symmetric functions

A property of the elementary symmetric functions Calcolo manuscrpt No. (wll be nserted by the edtor) A property of the elementary symmetrc functons A. Esnberg, G. Fedele Dp. Elettronca Informatca e Sstemstca, Unverstà degl Stud della Calabra, 87036,

More information

n α 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

n α 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 information

CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić

CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE. Jovanka Nikić 147 Kragujevac J. Math. 25 (2003) 147 154. CONDITIONS FOR INVARIANT SUBMANIFOLD OF A MANIFOLD WITH THE (ϕ, ξ, η, G)-STRUCTURE Jovanka Nkć Faculty of Techncal Scences, Unversty of Nov Sad, Trg Dosteja Obradovća

More information

Norms, Condition Numbers, Eigenvalues and Eigenvectors

Norms, Condition Numbers, Eigenvalues and Eigenvectors Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b

More information

The Minimum Universal Cost Flow in an Infeasible Flow Network

The Minimum Universal Cost Flow in an Infeasible Flow Network Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties Robust observed-state feedback desgn for dscrete-tme systems ratonal n the uncertantes Dmtr Peaucelle Yosho Ebhara & Yohe Hosoe Semnar at Kolloquum Technsche Kybernetk, May 10, 016 Unversty of Stuttgart

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 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 information

Eigenvalues of Random Graphs

Eigenvalues of Random Graphs Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the

More information

On the Multicriteria Integer Network Flow Problem

On the Multicriteria Integer Network Flow Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.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 information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

Static Output Feedback Control for Discrete-time Switched Linear Systems under Arbitrary Switching

Static Output Feedback Control for Discrete-time Switched Linear Systems under Arbitrary Switching 29 Amercan Control Conference Hyatt Regency Rverfront, St. Lous, MO, USA June -2, 29 ThA2.6 Statc Output Feedback Control for Dscrete-tme Swtched Lnear Systems under Arbtrary Swtchng Da-We Dng and Guang-Hong

More information

An Introduction to Morita Theory

An Introduction to Morita Theory An Introducton to Morta Theory Matt Booth October 2015 Nov. 2017: made a few revsons. Thanks to Nng Shan for catchng a typo. My man reference for these notes was Chapter II of Bass s book Algebrac K-Theory

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: 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 information

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2

Lecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2 P470 Lecture 6/7 (February 10/1, 014) DIRAC EQUATION The non-relatvstc Schrödnger equaton was obtaned by notng that the Hamltonan H = P (1) m can be transformed nto an operator form wth the substtutons

More information

Computing Correlated Equilibria in Multi-Player Games

Computing Correlated Equilibria in Multi-Player Games Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,

More information

LECTURE 9 CANONICAL CORRELATION ANALYSIS

LECTURE 9 CANONICAL CORRELATION ANALYSIS LECURE 9 CANONICAL CORRELAION ANALYSIS Introducton he concept of canoncal correlaton arses when we want to quantfy the assocatons between two sets of varables. For example, suppose that the frst set of

More information

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of

Chapter 7 Generalized and Weighted Least Squares Estimation. In this method, the deviation between the observed and expected values of Chapter 7 Generalzed and Weghted Least Squares Estmaton The usual lnear regresson model assumes that all the random error components are dentcally and ndependently dstrbuted wth constant varance. When

More information

for Linear Systems With Strictly Diagonally Dominant Matrix

for Linear Systems With Strictly Diagonally Dominant Matrix MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1269-1273 On an Accelerated Overrelaxaton Iteratve Method for Lnear Systems Wth Strctly Dagonally Domnant Matrx By M. Madalena Martns*

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS

A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS A LINEAR PROGRAMMING APPROACH FOR REGIONAL POLE PLACEMENT UNDER POINTWISE CONSTRAINTS Max M.D. SANTOS, Eugêno B. CASTELAN, Jean-Claude HENNET Abstract Ths paper consders the problem of control of dscrete-tme

More information

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction

ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: v1 [math.co] 1 Mar 2014 Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest

More information

CHAPTER III Neural Networks as Associative Memory

CHAPTER III Neural Networks as Associative Memory CHAPTER III Neural Networs as Assocatve Memory Introducton One of the prmary functons of the bran s assocatve memory. We assocate the faces wth names, letters wth sounds, or we can recognze the people

More information

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices

The Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan

More information

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function

A Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,

More information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41, The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson

More information

Non-negative Matrices and Distributed Control

Non-negative Matrices and Distributed Control Non-negatve Matrces an Dstrbute Control Yln Mo July 2, 2015 We moel a network compose of m agents as a graph G = {V, E}. V = {1, 2,..., m} s the set of vertces representng the agents. E V V s the set of

More information

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor Prncpal Component Transform Multvarate Random Sgnals A real tme sgnal x(t can be consdered as a random process and ts samples x m (m =0; ;N, 1 a random vector: The mean vector of X s X =[x0; ;x N,1] T

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

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.

= = = (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 information

MEM Chapter 4b. LMI Lab commands

MEM Chapter 4b. LMI Lab commands 1 MEM8-7 Chapter 4b LMI Lab commands setlms lmvar lmterm getlms lmedt lmnbr matnbr lmnfo feasp dec2mat evallm showlm setmvar mat2dec mncx dellm delmvar gevp 2 Intalzng the LMI System he descrpton of an

More information

Self-complementing permutations of k-uniform hypergraphs

Self-complementing permutations of k-uniform hypergraphs Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty

More information

Dynamic Systems on Graphs

Dynamic Systems on Graphs Prepared by F.L. Lews Updated: Saturday, February 06, 200 Dynamc Systems on Graphs Control Graphs and Consensus A network s a set of nodes that collaborates to acheve what each cannot acheve alone. A network,

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

P.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen

P.P. PROPERTIES OF GROUP RINGS. Libo Zan and Jianlong Chen Internatonal Electronc Journal of Algebra Volume 3 2008 7-24 P.P. PROPERTIES OF GROUP RINGS Lbo Zan and Janlong Chen Receved: May 2007; Revsed: 24 October 2007 Communcated by John Clark Abstract. A rng

More information

MATH Sensitivity of Eigenvalue Problems

MATH 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 information

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Solutions 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 information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Smarandache-Zero Divisors in Group Rings

Smarandache-Zero Divisors in Group Rings Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

5 The Rational Canonical Form

5 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 information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS 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 information

Lecture 17: Lee-Sidford Barrier

Lecture 17: Lee-Sidford Barrier CSE 599: Interplay between Convex Optmzaton and Geometry Wnter 2018 Lecturer: Yn Tat Lee Lecture 17: Lee-Sdford Barrer Dsclamer: Please tell me any mstake you notced. In ths lecture, we talk about the

More information

Lecture 10: May 6, 2013

Lecture 10: May 6, 2013 TTIC/CMSC 31150 Mathematcal Toolkt Sprng 013 Madhur Tulsan Lecture 10: May 6, 013 Scrbe: Wenje Luo In today s lecture, we manly talked about random walk on graphs and ntroduce the concept of graph expander,

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

Genericity of Critical Types

Genericity of Critical Types Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f

More information

1 GSW Iterative Techniques for y = Ax

1 GSW Iterative Techniques for y = Ax 1 for y = A I m gong to cheat here. here are a lot of teratve technques that can be used to solve the general case of a set of smultaneous equatons (wrtten n the matr form as y = A), but ths chapter sn

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

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 information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

SELECTED 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 (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 information

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980 MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and

More information

Affine transformations and convexity

Affine 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 information

Math 217 Fall 2013 Homework 2 Solutions

Math 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 information

Slobodan Lakić. Communicated by R. Van Keer

Slobodan 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 information

Root Structure of a Special Generalized Kac- Moody Algebra

Root Structure of a Special Generalized Kac- Moody Algebra Mathematcal Computaton September 04, Volume, Issue, PP8-88 Root Structu of a Specal Generalzed Kac- Moody Algebra Xnfang Song, #, Xaox Wang Bass Department, Bejng Informaton Technology College, Bejng,

More information

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0 Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of

More information

3.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

3.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 information

7. Products and matrix elements

7. Products and matrix elements 7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

More information