hapter 6 System Norms 6. Introducton s n the matrx case, the measure on a system should be nduced from the space of sgnals t operates on. hus, the sze
|
|
- Elvin Spencer
- 6 years ago
- Views:
Transcription
1 Lectures on Dynamc Systems and ontrol Mohammed Dahleh Munther. Dahleh George Verghese Department of Electrcal Engneerng and omputer Scence Massachuasetts Insttute of echnology c
2 hapter 6 System Norms 6. Introducton s n the matrx case, the measure on a system should be nduced from the space of sgnals t operates on. hus, the sze of a system s best measured by the maxmum amplcaton t exerts on a set of sgnals wth unt norm. Let us denote by khk p the nduced norm of the system G as t operates on L p (` p),.e., khu k p khkp sup : (6.) u6 kuk p Observe that a system G s p-stable f and only f khk p s nte. In partcular, the nduced norm s the smallest constant such that kyk p kuk p. In ths chapter, we calculate the nduced norms over nte-ampltude sgnals and over nte-energy sgnals. 6. L -Induced Norm contnuous-tme LI system may b e characterzed by ts mpulse response matrx, H( ), whose ( j)th entry h j ( ) s the mpulse response from the jth nput to the th output. In other words the nput-output relaton s gven by Z y(t) H(t ; )u( )d : heorem 6. he L -nduced norm of a LI system wth m nputs, p outputs, and mpulse response matrx H(t) s gven by v X m Z khk max jh j (t)j dt: p j
3 4 ( j Proof: If u s an nput sgnal that satses kuk <,.e. a bounded sgnal, then we h a ve Z y(t) H(t ; )u( )d and max p Z mx jy (t)j max h j (t ; )u j () d Z 3 X max jh j (t ; )j d max sup ju j (t)j: j j t It follows that kyk sup max jy (t)j t max X Z j 3 jh j (t)jdt kuk < : o show that the above upper bound can be acheved, we s h o w that for any small numb e r > w e can exhbt an nput whose peak magntude s and that results n an output whose peak magntude s larger than khk ;. We wll do ths for the case when p m where the mpulse response s h(t), for notatonal smplcty. Snce h(t) s absolutely ntegrable, for any gven > there exsts a tme such that Z jh(t)j dt k hk ; : ; Now c hoose the nput u (t) sgn(h(;t)) ; t jtj > we g e t sup t jy(t)j jy()j j Z ; Z ; jh( ; )jd (khk ; ) s u p ju (t)j t khk ; h( ; )u ( )d j hs nduced norm s called the L -norm of H(t). In the scalar case, ths number s just the L ;norm of h( ), regarded as a sgnal.
4 ` -Induced Norm he dscrete-tme case s qute smlar to contnuous-tme where we start wth a pulse response matrx, H( ), whose ( j)th entry h j ( ) s the pulse response from the jth nput to the th output. he nput-output relaton s gven by X y(t) H(t ; )u( ) : heorem 6. he ` -nduced norm of a D LI system wth m nputs, p outputs, and pulse response matrx H(t) s: mx X max jh j (t)j: p j t hs nduced norm s called the ` norm of the system H. 6.3 L -Induced Norm L I system s, n general, characterzed by the mpulse response matrx functon H(). Here, we wll also assume that the system s causal and ts Laplace transform exsts n some rght half plane n the complex plane, and s denoted by H(s). he nput-output relaton s then gven by Y (s) H(s)U (s): It s evdent th a t f H(s) has a pole n the RHP, then t s not L -stable (verfy!). o calculate L -nduced norm, we wll assume that H(s) s analytc n the open RHP (no poles n the open RHP). heorem 6.3 he L -nduced norm of a causal, LI system H(s) w h ch s analytc n the open RHP s sup max [H(jw )] : w Proof: Recall Parseval's equalty, Z kyk Y (jw )Y (jw )dw: ; Usng ths equalty w e can get the followng bound on kyk : kyk Z max [H(jw)] U (jw)u(jw)dw sup max [H(jw)] kuk : ; w o show that ths bound s tght, we need to show that f max [H(jw )] c then there exsts an nput wth -norm equal to one, that produces an output wth -norm arbtrarly close
5 to c. If H s a SISO system, then the constructon of such an nput s straghtforward pck u(t) e ;jw t t. hen, as approaches nnty, the k yk approaches H(jw ). In the general MIMO case, ths sgnal s multpled by the sngular vector assocated wth the largest sngular value of H(jw ). he detals of ths are left as an exercse. ` -Induced Norm D L I causal system wth a unt sample response H has a Z- ransform, H(z), whch s analytc outsde some dsc n the complex plan. Here we assume that H(z) s analytc outsde the unt dsc. heorem 6.4 he ` -nduced norm of a causal, LI system H(z) whch s analytc outsde the open unt dsc s h sup H(e jw max ) : w he quantty sup w max [H(jw )] s known as the H -norm of the system. It measures the maxmum energy amplcaton of nte energy nputs. It turns out (See Exercse 6.) that ths measures the maxmum amplcaton over sgnals wth nte p o wer. In the SISO case, the H -norm corresponds to the peak value of the ode plot. omputaton of k Hk for ontnuous-tme Systems One method of computng k Hk for a system would be to sample the functon max [H(j! )] over a number of ponts n! [ ). In prncple, f one samples nely enough, the locaton of the peak sngular value can be found however, what consttutes a sucently ne samplng of max [H(j! )] n the frequency doman? For example, a hgh order system may h a ve a f r e - quency response whch m o ves around consderably, wth a large number of peaks and valleys. n alternatve approach s to use a state space technque, whch w e wll now dscuss. heorem 6.5 Let H(s) b e a transfer functon derved from a stable lnear tme-nvarant system wth descrpton ( ) (assume D ). Dene " # M ; ; hen, the k Hk < f and only f M has no purely magnary egenvalues. Proof: Frst, observe t h a t k Hk < () I ; H (j!)h(j!) s nvertble for all! R ; () I ; H (; s)h(s) has no poles on the magnary axs :
6 he rst equvalence follows drectly from the denton of the H norm. he converse reles on the strct properness of of H,.e., f khk then there exsts at least one frequency that hts ths bound. he second equvalence s straghtforward. Now, we show that M s the matrx of (I ; H (;s)h(s)) ;. hs s done by constructng a realzaton of the system shown n Fgure 6.. u y y H (;s) u y H(s) u y Fgure 6.: onstructon of I ; h H (;s)h(s) Notce that for ths system, the transfer functon mappng u to y s I ; H (;s)h(s). Snce H(s) ( ), t follows that H (;s) (; ; ). he composte system can be descrbed as x_ x + y y x x_ ; x ; y y x y u + y : y elmnatng the nternal sgnals y and y we get the followng realzaton of the closed-loop system whch p r o ves the clam. " # " # " # " # d x x dt x ; ; x h y h + hs theorem allows us to calculate khk to any arbtrary precson va the followng bsecton procedure:. Start wth a guess for a lower bound to khk, and denote t by l. + I ;. u ;
7 . Guess an upper bound to khk, u, and verfy that t s an upper bound by computng the egenvalues of M u and verfyng that none are purely magnary. 3. If u ; l s wthn the requred accuracy, s t o p. 4. Dene ( l + u ), and compute the egenvalues of M. If there are purely magnary egenvalues then set l, otherwse set u. 5. Go to step he H Norm: Energy of the Response to an Impulse Suppose we have a stable contnuous-tme system wth a transfer functon H(s) (si ; ) ;, and mpulse response H(t) e t, then we dene the H norm as khk Z ; khk Z trace(h(j! ) H(j! ))d! trace(h(t) H(t))dt: he computaton of the H norm can be performed by solvng a Lyapunov equaton. Observe that khk Z t trace( e e t )dt trace( Q) where Q s refered to as the observablty graman whch can b e computed by solvng the followng Lyapunov equaton Q + Q + : Equvalently we can wrte khk Z trace(e t e trace(p ) t )dt where P s refered to as the controllablty graman whch can b e computed by solvng the followng Lyapunov equaton P + P + : Fnally, the H norm for D LI systems s dened as khk Z trace(h(e khk X trace(h(t) H(t)): t ) H(e ))d
8 ; + hs norm can also be computed va solvng D Lyapunov equatons. 6.5 Submultplcatve Property s n the matrx case, nduced norms satsfy the submultplcatve p r o p e r t y. For any systems G G wth compatble dmenson such that G G s dened, t follows that kg G k p k G k p kg k p : For a IO stable LI system, t follows then that b o t h the ` and the H norms satsfy ths property, h o wever, the H does not. Example 6. Norm omputatons Let's consder the followng two-mass two-sprng system G : m y + c y_ + k y + c ( y_ ; y_ ) + k (y ; y ) u my + c ( y_ ; y_ ) + k (y ; y ) u : Let x y, x y_, x 3 y, and x 4 y_. hen the equatons above can be wrtten n an LI state space form as follows: x_ x! k +k c k ; +c c u x_ x_ 3 x_ 4 m m m m x m k c k ; m m ; m!! y y x x x 3 : x 4 U c m x 3 x 4 U m u K K M M Y Y Fgure 6.: -mass -sprng system
9 Z P! x_ x + u y x: Wth m m, c c, and k k, w e h a ve the followng and matrces: ; ; ; ; Let's rst compute L norm of ths system. For that purpose, we need need the mpulse response of the system, H(t), where y(t) H(t ; )u( )d: he mpulse response matrx s gven by H(t) e t. o compute ths matrx, we select a matrx M that puts n a modal form. It follows that: where wth ; (R(t)) H(t) e t M e M e Rt a a a 33 a 34 a a ;a a a 33 a 34 ;a 34 a 33 e t cos(! t) e t sn(! t) t e cos(! t) e t sn(! t) : p 3 where ;,!, and ;:5,! are the real and magnary parts of the rst and second complex conjugate pars of egenvalues. hus ` norm of the system G can b e computed as follows: Z X khk max jh j (t)jdt max max j :8833 P R! j jh R j (t)jdt j jh j (t) jdt! :445 :8833
10 : H.5.5 Frequency ω Fgure 6.3: Sngular values of the system - Sold: max, Dashed: mn hus ` norm of ths system s In order to compute H norm of the system, we solve the followng Laypunov equaton P + P + whch yelds ;:5 :5 :5 P :5 :5 :5 From ths, t follows that khk trace(p herefore! ;:5 :5 :5 ) trace 3 :5: :5 :5 :5 khk p 3:5 :878: We wll compute the khk for a system by samplng the functon max [H(j! )] over a n umber of ponts n! [ ). he plot of max [H(j! )] as a functon of! s plotted below. It can b e seen drectly from the plot that the maxmum value of max [H(j! )] s about 4.45 at! :56. lternatvely, usng the teratve procedure outlned n steps -5 above, we can construct the matrces M for varous values to obtan khk. s shown n the table b elow, khk s approxmately 4.453, whch matches wth the approxmaton obtaned by samplng max (H(jw )).!
11 l u Egenvalues of M / /-.9479, +/-.6473, +/ /-.37 +/-.9486, +/-.87 +/ /-.37 +/-.9483, +/-.66, +/ /-.37 +/-.9484, +/-.593, +/ /-.37 +/-.9485, +/-.573, +/ /-.37 +/-.9485, +/-.64 +/ /-.37 +/-.9485, +/-.56, +/-.557
12 Exercses Exercse 6. We have shown n class that the H -norm arses from measurng the largest I/O energy-to-energy amplcaton. In ths problem, we w ant t o s h o w that the H norm can also be seen as determnng the largest p o wer-to-power amplcaton. For that, consder a LI system wth n n transfer functon H(s), nput u R and output y R. Recall that the H -norm of the system, whch w e smply denote by khk, s g v en by khk sup max [H(jw )] : w Remember also that the power of a contnuous-tme sgnal v s gven by np N u e jw t P v lm Z L L! L ;L v (t)v(t)dt Dene the set X : u R n w R. In ths problem, we want to show that sup Pu P y khk, at least for u X (although the result holds more generally for any u that has a well-dened power spectrum). (a) Let u X. ompute the power of u. (b) ompute the power of the system output y. (c) Now show that sup Pu P y k Hk. (d) Show that equalty can be acheved by p c kng the approprate nput u X. o! Exercse 6. (a) onsder a D LI system (not necessarly nte-dmensonal) speced by t h e I/O convoluton relatonshp y(k) hu(k), where the unt sample response h(k) has z-transform H(z). Show that f the system s -stable then t s -stable. (Hnt: Show that kh uk khk kuk.) lthough the converse s true for nte-dmensonal LI systems, t s not true n general, as part (b) below s h o ws. (b) Frst show that f a sequence s ` then ts z-transform evaluated on the unt crcle s contnuous,.e., f h ` then H(e j ) s contnuous n. Now s h o w that the system wth transfer functon ; H(z) e z; ; s -stable but not -stable. You have to show that H(z) s analytc outsde the unt crcle and bounded on the crcle, but that t s not contnuous on the crcle. Exercse 6.3 he table below s h o ws the nduced norms of an LI system wth respect to several nput and output norms. Some entres have already been shown n ths chapter or n the exercses. Verfy the rest of the entres.
13 OutputnInput ` ` Power ` ` H ` H Power H H able 6.: omparson of nduced norms.
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 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 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 information2.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 informationSingular 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 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 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 informationMEM633 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 informationComplex Numbers, Signals, and Circuits
Complex Numbers, Sgnals, and Crcuts 3 August, 009 Complex Numbers: a Revew Suppose we have a complex number z = x jy. To convert to polar form, we need to know the magntude of z and the phase of z. z =
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 informationFall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede
Fall 0 Analyss of Expermental easurements B. Esensten/rev. S. Errede We now reformulate the lnear Least Squares ethod n more general terms, sutable for (eventually extendng to the non-lnear case, and also
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 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 informationDynamic 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 information1 Convex Optimization
Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,
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 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 informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationNorm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise
ppled Mathematcal Scences, Vol. 4, 200, no. 60, 2955-296 Norm Bounds for a ransformed ctvty Level Vector n Sraffan Systems: Dual Exercse Nkolaos Rodousaks Department of Publc dmnstraton, Panteon Unversty
More informationIf A(k ; ), A(k ; 2),..., A(`) are all nvertble, then one could use the state transton matrx to obtan x(k) from x(`) even when k < `, but we shall typ
Unversty of Calforna Department of Mechancal Engneerng Lnear Systems Fall 999 (B. Bameh) Lecture 4: Dscrete-Tme Lnear State-Space Models In the prevous lecture we showed how dynamc models arse, and studed
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
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 informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
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 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 informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationNeuro-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 information10-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 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 informationCME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13
CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
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 informationGeorgia Tech PHYS 6124 Mathematical Methods of Physics I
Georga Tech PHYS 624 Mathematcal Methods of Physcs I Instructor: Predrag Cvtanovć Fall semester 202 Homework Set #7 due October 30 202 == show all your work for maxmum credt == put labels ttle legends
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationQuantum Mechanics I - Session 4
Quantum Mechancs I - Sesson 4 Aprl 3, 05 Contents Operators Change of Bass 4 3 Egenvectors and Egenvalues 5 3. Denton....................................... 5 3. Rotaton n D....................................
More information), it produces a response (output function g (x)
Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans
More informationMore 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 informationComplex Variables. Chapter 18 Integration in the Complex Plane. March 12, 2013 Lecturer: Shih-Yuan Chen
omplex Varables hapter 8 Integraton n the omplex Plane March, Lecturer: Shh-Yuan hen Except where otherwse noted, content s lcensed under a BY-N-SA. TW Lcense. ontents ontour ntegrals auchy-goursat theorem
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 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 on Multivariable Feedback Control
Lectures on Multvarable Feedback Control Al Karmpour Department of Electrcal Engneerng, Faculty of Engneerng, Ferdows Unversty of Mashhad June 200) Chapter 9: Quanttatve feedback theory Lecture Notes of
More informationLecture 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 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 informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationLecture 4: Constant Time SVD Approximation
Spectral Algorthms and Representatons eb. 17, Mar. 3 and 8, 005 Lecture 4: Constant Tme SVD Approxmaton Lecturer: Santosh Vempala Scrbe: Jangzhuo Chen Ths topc conssts of three lectures 0/17, 03/03, 03/08),
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationTransfer 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 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 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 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 informationThe 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 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 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 informationNP-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 informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationThe 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 informationLECTURE 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 informationSnce h( q^; q) = hq ~ and h( p^ ; p) = hp, one can wrte ~ h hq hp = hq ~hp ~ (7) the uncertanty relaton for an arbtrary state. The states that mnmze t
8.5: Many-body phenomena n condensed matter and atomc physcs Last moded: September, 003 Lecture. Squeezed States In ths lecture we shall contnue the dscusson of coherent states, focusng on ther propertes
More informationCHAPTER 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 informationMechanics Physics 151
Mechancs Physcs 151 Lecture 3 Lagrange s Equatons (Goldsten Chapter 1) Hamlton s Prncple (Chapter 2) What We Dd Last Tme! Dscussed mult-partcle systems! Internal and external forces! Laws of acton and
More informationChat 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 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 informationProf. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model
EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
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 informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationModule 3: Element Properties Lecture 1: Natural Coordinates
Module 3: Element Propertes Lecture : Natural Coordnates Natural coordnate system s bascally a local coordnate system whch allows the specfcaton of a pont wthn the element by a set of dmensonless numbers
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More information332600_08_1.qxp 4/17/08 11:29 AM Page 481
336_8_.qxp 4/7/8 :9 AM Page 48 8 Complex Vector Spaces 8. Complex Numbers 8. Conjugates and Dvson of Complex Numbers 8.3 Polar Form and DeMovre s Theorem 8.4 Complex Vector Spaces and Inner Products 8.5
More informationNorms, 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 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 informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
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 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 informationSolutions to Problem Set 6
Solutons to Problem Set 6 Problem 6. (Resdue theory) a) Problem 4.7.7 Boas. n ths problem we wll solve ths ntegral: x sn x x + 4x + 5 dx: To solve ths usng the resdue theorem, we study ths complex ntegral:
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationNew Method for Solving Poisson Equation. on Irregular Domains
Appled Mathematcal Scences Vol. 6 01 no. 8 369 380 New Method for Solvng Posson Equaton on Irregular Domans J. Izadan and N. Karamooz Department of Mathematcs Facult of Scences Mashhad BranchIslamc Azad
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 information[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962).
[7] R.S. Varga, Matrx Iteratve Analyss, Prentce-Hall, Englewood ls, New Jersey, (962). [8] J. Zhang, Multgrd soluton of the convecton-duson equaton wth large Reynolds number, n Prelmnary Proceedngs of
More informationSolutions to Exercises in Astrophysical Gas Dynamics
1 Solutons to Exercses n Astrophyscal Gas Dynamcs 1. (a). Snce u 1, v are vectors then, under an orthogonal transformaton, u = a j u j v = a k u k Therefore, u v = a j a k u j v k = δ jk u j v k = u j
More information( ) = ( ) + ( 0) ) ( )
EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
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 informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
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 informationarxiv: v1 [quant-ph] 6 Sep 2007
An Explct Constructon of Quantum Expanders Avraham Ben-Aroya Oded Schwartz Amnon Ta-Shma arxv:0709.0911v1 [quant-ph] 6 Sep 2007 Abstract Quantum expanders are a natural generalzaton of classcal expanders.
More informationU.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 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 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 information6) Derivatives, gradients and Hessian matrices
30C00300 Mathematcal Methods for Economsts (6 cr) 6) Dervatves, gradents and Hessan matrces Smon & Blume chapters: 14, 15 Sldes by: Tmo Kuosmanen 1 Outlne Defnton of dervatve functon Dervatve notatons
More informationExample: (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 informationLecture 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 informationAppendix 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 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 informationTHEOREMS OF QUANTUM MECHANICS
THEOREMS OF QUANTUM MECHANICS In order to develop methods to treat many-electron systems (atoms & molecules), many of the theorems of quantum mechancs are useful. Useful Notaton The matrx element A mn
More information