COMPUTING THE NORM OF A MATRIX
|
|
- Norah Blankenship
- 5 years ago
- Views:
Transcription
1 COMPUTING THE NORM OF A MATRIX KEITH CONRAD 1. Introducton In R n there s a standard noton of length: the sze of a vector v = (a 1,..., a n ) s v = a a2 n. We wll dscuss n Secton 2 the general concept of length n a vector space, called a norm, and then look at norms on matrces n Secton 3. In Secton 4 we ll see how the matrx norm that s closely connected to the standard norm on R n can be computed from egenvalues of an assocated symmetrc matrx. 2. Norms on Vector Spaces Let V be a vector space over R. A norm on V s a functon : V R satsfyng three propertes: (1) v 0 for all v V, wth equalty f and only f v = 0, (2) v + w v + w for all v and w n V, (3) cv = c v for all c R and v V. The same defnton apples to complex vector spaces. From a norm on V we get a metrc on V by d(v, w) = v w. The trangle nequalty for ths metrc s a consequence of the second property of norms. Example 2.1. The standard norm on R n, usng the standard bass e 1,..., e n, s n a e = n a 2. Ths gves rse to the Eucldean metrc on R n : d( a e, b e ) = (a b ) 2. Example 2.2. The sup-norm on R n s n a e = max a. sup Ths gves rse to the sup-metrc on R n : d( a e, b e ) = max a b. Example 2.3. On C n the standard norm and sup-norm are defned smlarly to the case of R n, but we need z 2 nstead of z 2 when z s complex: n a e = n a 2 n, a e = max a. sup 1
2 2 KEITH CONRAD A common way of placng a norm on a real vector space V s by an nner product, whch s a parng (, ): V V R that s (1) blnear: lnear n each component when the other s fxed. Lnearty n the frst component means (v + v, w) = (v, w) + (v, w) and (cv, w) = c(v, w) for v, v, w V and c R, and smlarly n the second component. (2) symmetrc: (v, w) = (w, v). (3) postve-defnte: (v, v) 0, wth equalty f and only f v = 0. The standard nner product on R n s the dot product: ( n ) n n a e, b e = a b. For an nner product (, ) on V, a norm can be defned by the formula v = (v, v). That ths s actually a norm on V follows from the Cauchy Schwarz nequalty (2.1) (v, w) (v, v)(w, w) = v w as follows. For all v and w n V, v + w 2 = (v + w, v + w) = (v, v) + (v, w) + (w, v) + (w, w) = v 2 + 2(v, w) + w 2 v (v, w) + w 2 snce a a for all a R v v w + w 2 by (2.1) = ( v + w ) 2. Takng (postve) square roots of both sdes yelds v + w v + w. A proof of the Cauchy Schwarz nequalty s n the appendx. Usng the standard nner product on R n, the Cauchy Schwarz nequalty assumes ts classcal form, as proven by Cauchy (1821): n a b = n n a 2 b 2. The Cauchy Schwarz nequalty (2.1) s true for every nner product on a real vector space, not just the standard nner product on R n. Whle the norm on R n that comes from the standard nner product s the standard norm, the sup-norm on R n does not arse from an nner product,.e., there s no nner product whose assocated norm s the sup-norm. Even though the sup-norm and the standard norm on R n are not equal, they are each bounded by a constant multple of the other one: (2.2) max a n I=1 a 2 n max a..e., v sup v n v sup for all v R n. Therefore the metrcs these two norms gve rse to determne the same notons of convergence: a sequence n R n that s convergent wth
3 COMPUTING THE NORM OF A MATRIX 3 respect to one of the metrcs s also convergent wth respect to the other metrc. Also R n s complete wth respect to both of these metrcs. The standard nner product on R n s closely ted to transposton of n n matrces. For A = (a j ) M n (R), let A = (a j ) be ts transpose. Then for all v, w R n, (2.3) (Av, w) = (v, A w), where (, ) s the standard nner product on R n. We now brefly ndcate what nner products are on complex vector spaces. An nner product on a complex vector space V s a parng (, ): V V C that s (1) lnear on the left and conjugate-lnear on the rght: t s addtve n each component wth the other one fxed and (cv, w) = c(v, w) and (v, cw) = c(v, w) for c C. (2) skew-symmetrc: (v, w) = (w, v), (3) postve-defnte: (v, v) 0, wth equalty f and only f v = 0. Physcsts usually defne nner products on complex vector spaces as beng lnear on the rght and conjugate-lnear on the left. It s just a dfference n notaton. The standard nner product on C n s not the dot product, but has a conjugaton n the second component: ( n ) n n (2.4) a e, b e = a b. Ths standard nner product on C n s closely ted to conjugate-transposton of n n complex matrces. For A = (a j ) M n (C), let A = A = (a j ) be ts conjugate-transpose. Then for all v, w C n, (2.5) (Av, w) = (v, A w). An nner product on a complex vector space satsfes the Cauchy Schwarz nequalty, so t can be used to defne a norm just as n the case of nner products on real vector spaces. Although we wll be focusng on norms on fnte-dmensonal spaces, the extenson of these deas to nfnte-dmensonal spaces s qute mportant n both analyss and physcs (quantum mechancs). Exercses. 1. Lettng (, ) m be the dot product on R m and (, ) n be the dot product on R n, show for each m n matrx A, v R n, and w R m that (Av, w) m = (v, A w) n. When m = n ths becomes (2.3). 2. Verfy (2.5). 3. Defnng Norms on Matrces From now on, the norm and nner product on R n and C n are the standard ones. The set of n n real matrces M n (R) forms a real vector space. How should we defne a norm on M n (R)? One dea s to vew M n (R) as R n2 and use the sup-norm on R n2 (a j ) sup = max a j.,j or the standard norm on R n2 : (a j ) = a 2 j. These turn out not to be the best choces. Before ndcatng a better norm on M n (R), let s use the sup-norm on M n (R) to show that
4 4 KEITH CONRAD each n n matrx changes the (standard) length of vectors n R n by a unformly bounded amount that depends on n and the matrx. For v = (c 1,..., c n ) R n, Av n Av sup by (2.2) = n n max a j c j j=1 n n max a j c j n max j=1 n a j v sup j=1 n n max a j v,j sup n n max a j v by (2.2).,j Let C = n n max a j. Ths s a constant dependng on the dmenson n of the space and the matrx A, but not on v, and Av C v for all v. By lnearty, Av Aw C v w for all v, w R n. Let s wrte down the above calculaton as a lemma. Lemma 3.1. For each A M n (R), there s a C 0 such that Av C v for all v R n. The constant C we wrote down mght not be optmal. Perhaps there s a smaller constant C < C such that Av C v for all v R n. We wll get a norm on M n (R) by assgnng to each A M n (R) the least C 0 such that Av C v for all v R n, where the vector norms n Av and v are the standard ones on R n. Theorem 3.2. For each A M n (R), there s a unque real number b 0 such that () Av b v for all v R n, () b s mnmal: f Av C v for all v R n, then b C. Proof. We frst show by a scalng argument that Av b v for all v R n f and only f Av b for all v R n wth v = 1. The drecton ( ) s clear by usng v = 1. For the drecton ( ), when v = 0 we trvally have Av = 0 = b v. When v 0 let c = v, so c > 0 and the vector v/c has norm 1 ( v/c = 1/c v = (1/ c ) v = (1/ v ) v = 1), so by hypothess A(v/c) b, whch mples (1/ c ) Av b by lnearty. Now multply both sdes by c to get Av bc = b v. Therefore the theorem s sayng the set { Av : v = 1} has a (fnte) maxmum value, whch s b. Ths s what we wll prove. The matrx A as a functon R n R n s contnuous snce the components of Av are lnear functons of the components of v, and hence they are each contnuous n v. The standard norm : R n R s also contnuous snce t s the square root of a polynomal functon of the coordnates. Fnally, snce the unt ball n R n, {v R n : v = 1}, s compact ts contnuous mage { Av : v = 1} n R s also compact. Every compact subset of R contans a maxmum pont, so we are done. Defnton 3.3. For A M n (R), A s the smallest nonnegatve real number satsfyng the nequalty Av A v for all v R n. Ths s called the operator norm of A.
5 COMPUTING THE NORM OF A MATRIX 5 Theorem 3.2 shows A exsts and s the maxmum of Av when v runs over the unt ball n R n. The next theorem shows the operator norm on M n (R) s a vector space norm and has a host of other nce propertes. Theorem 3.4. For A, B M n (R) and v, w R n, () A 0, wth equalty f and only f A = O. () A + B A + B. () ca = c A for c R. (v) AB A B. It s typcally false that AB = A B. (v) A = A. (v) AA = A A = A 2. Thus A = AA = A A. (v) (Av, w) A v w. (v) A sup A n n A sup and M n (R) s complete wth respect to the metrc comng from the operator norm. Proof. () It s obvous that A 0. If A = 0 then for all v R n we have Av 0 v = 0, so Av = 0. Thus Av = 0 for all v R n, so A = O. The converse s trval. () For all v R n, (A + B)v = Av + Bv Av + Bv A v + B v = ( A + B ) v. Snce A + B s the least C 0 such that (A + B)v C v for all v R n, A + B A + B. () Left to the reader. (v) For all v R n, (AB)v = A(Bv) A Bv A B v, so the mnmalty property of the operator norm mples AB A B. To show that generally AB A B, note that f AB = A B for all A and B n M n (R) then for nonzero A and B we d have AB 0, so AB O. That s, the product of two nonzero matrces s always nonzero. Ths s false when n > 1, snce there are many nonzero matrces whose square s zero. (v) For all v R n, we get by (2.3) that Av 2 = (Av, Av) = (v, A Av) v A Av by Cauchy Schwarz. Ths last expresson s A A v 2, so Av A A v. The least C 0 such that Av C v for all v R n s A, so A A A. Squarng both sdes, (3.1) A 2 A A A A. Dvdng by A when A O, we get A A. Ths s also obvous f A = O, so (3.2) A A for all A M n (R). Now replace A by A n (3.2) to get A (A ) = A,
6 6 KEITH CONRAD so A = A. (v) Feedng the concluson of (v) back nto (3.1), A 2 A A A A = A 2, so A 2 = A A. Usng A n place of A here, we get A 2 = AA snce A = A. (v) Use Cauchy Schwarz: (Av, w) Av w A v w. (v) Set v = e j and w = e n (v): a j = (Ae j, e ) A. Therefore A sup A. The other nequalty follows from the calculaton leadng up to Lemma 3.1. That M n (R) s complete wth respect to the metrc d(a, B) = A B comng from the operator norm follows from completeness of M n (R) wth respect to the metrc comng from the sup-norm (vew M n (R) as R n2 ) and the fact that these two norms on M n (R) are bounded by constant multples of each other. The operator norm on M n (R) nteracts ncely wth the multplcatve structure on M n (R) and the standard nner product on R n (parts (v) through (v) of Theorem 3.4). However, unlke the standard norm on R n, the operator norm on M n (R) s mpossble to calculate from ts defnton n all but the smplest cases. For nstance, t s clear that I n = 1, so ci n = c for all c R. But what s ( ) 1 2? 3 4 By the last part of Theorem 3.4, ths norm s bounded above by 2 2(4) = In the next secton we wll gve a formula for the operator norm on M n (R) that wll allow us to compute ( ) easly, and t wll turn out to be 5.5. Exercses. 1. Rework ths secton for rectangular matrces that need not be square. For A n M m,n (R), defne ts operator norm A m,n to be the least b 0 such that Av m b v n for all v R n, where the subscrpts n the nequalty ndcate the standard norm on the Eucldean space of the relevant dmenson (m or n). Show A m,n exsts and A m,n = A n,m = AA m,m = A A n,n. You wll want to use the relatonshp between the transpose on M m,n (R) and dot products on R m and R n n Exercse Defne an operator norm on M n (C) and establsh an analogue of Theorem 3.4. Is t true that a matrx n M n (C) generally has the same operator norm as ts transpose? For a real n n matrx, show ts operator norm as an element of M n (R) equals ts operator norm as an element of M n (C). 4. A computatonal formula for a matrx norm The key dea to compute the operator norm of A M n (R) s that Theorem 3.4(v) tells us t s also the square root of the operator norm of AA and A A. What makes AA and A A specal s that they are symmetrc (equal to ts own transpose), e.g., (AA ) =
7 COMPUTING THE NORM OF A MATRIX 7 (A ) A = AA. 1 The followng theorem gves a method to compute operator norms of symmetrc matrces and then general square matrces. Theorem 4.1. (1) If A M n (R) satsfes A = A then all the egenvalues of A are real and (4.1) A = max egenvalues λ of A λ. (2) For all A M n (R), the egenvalues of AA and A A are all nonnegatve. Proof. (1) To prove that when A = A all the egenvalues of A are real, let A act on C n n the obvous way. Usng the standard nner product (2.4) on C n (not the dot product!), we have by (2.5) that for all v C n, (Av, v) = (v, A v) = (v, A v) = (v, A v) = (v, Av). For an egenvalue λ C of A, let v C n be a correspondng egenvector. Then (Av, v) = (λv, v) = λ(v, v), (v, Av) = (v, λv) = λ(v, v), so λ = λ snce (v, v) = v 2 0 (egenvectors are nonzero). Thus λ s real. To relate A to the egenvalues of A as n (4.1), we wll use a fundamental property of real symmetrc matrces that s called the Spectral Theorem. It asserts that every symmetrc matrx A M n (R) has a bass of mutually orthogonal egenvectors n R n. 2 Let v 1,..., v n be a bass of mutually orthogonal egenvectors for A, wth correspondng egenvalues λ 1,..., λ n. What s specal about orthogonal vectors s that ther squared lengths add (the Pythagorean theorem): f (v, w) = 0 then v + w 2 = (v + w, v + w) = (v, v) + 2(v, w) + (w, w) = (v, v) + (w, w) = v 2 + w 2 and lkewse for a sum of more than two mutually orthogonal vectors. Order the egenvalues of A so that λ 1... λ n. For each v R n, wrte t n terms of the bass of egenvectors as v = c 1 v c n v n. Then Av = c 1 A(v 1 ) + + c n A(v n ) = c 1 λ 1 v c n λ n v n. Snce the v s are mutually perpendcular, ther scalar multples c λ v are mutually perpendcular. Therefore Av 2 = c 1 λ 1 v c n λ n v n 2 = c 2 1λ 2 1 v 1 2 +, + c 2 nλ 2 n v n 2 c 2 1λ 2 n v 1 2 +, + c 2 nλ 2 n v n 2 snce λ λ n = λ 2 n(c 2 1 v 1 2 +, + c 2 n v n 2 ) = λ 2 n( c 1 v c n v n 2 ) = λ 2 n c 1 v c n v n 2 = λ 2 n v 2, 1 Ths s also true f A Mm,n(R) s a rectangular matrx, whch makes Secton 4 applcable to operator norms of rectangular matrces by Exercse The Spectral Theorem ncludes the asserton that all egenvalues of A are real, whch we showed above.
8 8 KEITH CONRAD so Av λ n v. Snce ths nequalty holds for all v n R n, we have A λ n. To prove A = λ n t now suffces to fnd a sngle nonzero vector v such that Av = λ n v. For that we can use v = v n snce Av n = λ n v n. (2) Snce AA and A A are both symmetrc, all ther egenvalues are real. Let λ R be an egenvalue of AA wth correspondng egenvector v R n, and let µ R be an egenvalue of A A wth correspondng egenvector w R n. Usng the standard nner product on R n, 0 (Aw, Aw) = (w, A Aw) = (w, µw) = µ(w, w). Then µ 0 snce (w, w) = w 2 > 0. Smlarly, 0 (A v, A v) = (v, AA v) = (v, λv) = λ(v, v). Snce (v, v) = v 2 > 0, t follows that λ 0. Corollary 4.2. For A M n (R), A s the square root of the largest egenvalue of AA and s the square root of the largest egenvalue of A A. Proof. By Theorem 3.4(v), A = AA = A A. Now use (4.1), wth AA and A A n place of A. Remark 4.3. Ths corollary, wthout proof, goes back to Peano [2, p. 454] usng A A. On the same page Peano ntroduced the operator norm on M n (R) from Defnton 3.3 and proved Theorem 3.4() and (v). In the same year (1888) Peano [3] ntroduced the frst axomatc treatment of real vector spaces (whch he called lnear systems ) of arbtrary dmenson and lnear operators on them; t was ahead of ts tme and largely forgotten, ncludng by Peano hmself. The man nspraton for the development of abstract lnear algebra came from work on normed vector spaces by Banach n the 1920s [1]. Example 4.4. Let s compute the operator norm of the 2 2 matrx ( ) 1 2 A =. 3 4 Snce AA = ( the characterstc polynomal of AA s X 2 30X + 4, whch has egenvalues 15 ± , Therefore the operator norm of A s , so for all ( x y) R 2, ( ) 5x + 11y 15 + ( ) 221 x 11x + 25y, y and s the smallest number wth that property. Computng the operator norm of A amounts to fndng the largest egenvalue of a related symmetrc matrx (AA or A A). In practce, for large symmetrc matrces the largest egenvalue s not computed by calculatng the roots of ts characterstc polynomal. More effcent algorthms for calculatng egenvalues are avalable (e.g., QR algorthm or Lanczos algorthm). ),
9 COMPUTING THE NORM OF A MATRIX 9 Exercses. 1. For A M m,n (R), show the egenvalues of the m m matrx AA and the n n matrx A A are nonnegatve. (The nonzero egenvalues of these matrces are also equal. For all A M m,n (R) and B M n,m (R), the matrces AB M m (R) and BA M n (R) have the same nonzero egenvalues.) 2. If you worked out propertes of operator norms of rectangular matrces n Exercse 3.1, determne the operator norm of the 2 3 matrx ( If we use a norm on R n other than the standard norm, the correspondng operator norm on M n (R) wll be dfferent from the one we have worked out here. When R n has a norm, the related operator norm of a matrx A M n (R) s the least b 0 such that Av b v for all v R n. Let s work out an example. Gve R n the sup-norm, so the assocated operator norm of an n n matrx A s the least b satsfyng Av sup b v sup for all v R n. What s b? (a) For all v R n, show Av sup b v sup where b = max 1 n n j=1 a j. (b) For each row (a 1,..., a n ) of A, show there s a vector v n R n wth coordnates from {±1} such that the th entry of Av equals a a n. Conclude that there s a v R n such that Av sup = b v sup where b s the number n part (a). Therefore the operator norm of A when usng the sup-norm on R n s b. 4. Generalze Theorem 4.1 to gve a computatonal formula for the operator norm of matrces n M n (C). ). Appendx A. Proof of Cauchy-Schwarz nequalty We gve a proof of the Cauchy Schwarz nequalty that was found by Schwarz [4, p. 344] n It s a clever trck wth quadratc polynomals and the context n whch Schwarz dscovered t s descrbed n [5, pp ]. (The whole book [5] s recommended as a lvely account of fundamental nequaltes n mathematcs.) Let V be a real vector space wth an nner product (, ). Pck v and w n V. Our goal s to show (v, w) v w. Ths s obvous f v or w s 0, so assume both are nonzero. For all t R, (v +tw, v+tw) 0. The left sde can be expanded to be a quadratc polynomal n t: (v + tw, v + tw) = (v, v) + (v, tw) + (tw, v) + (tw, tw) = (v, v) + t(v, w) + t(w, v) + t 2 (w, w) = v + 2(v, w)t + w t 2. Ths s quadratc snce w > 0. A quadratc polynomal n t has nonnegatve values for all t f and only f ts dscrmnant s 0, so (2(v, w)) 2 4 v w 0, whch s equvalent to (v, w) v w, and that completes the proof! Remark A.1. We have equalty (v, w) = v w f and only f the quadratc polynomal above has a double real root t, and at that root we get (v+tw, v+tw) = 0, so v+tw = 0 n V
10 10 KEITH CONRAD and thus v and w are lnearly ndependent. The converse drecton, that lnear dependence mples equalty n the Cauchy Schwarz nequalty, s left to the reader (also n the case that v or w s 0). References [1] G. H. Moore, The Axomatzaton of Lnear Algebra: , Hstora Mathematca 22 (1995), Onlne at [2] G. Peano, Intégraton par séres des équatons dfférentelles lnéares, Mathematsche Annalen 32 (1888), [3] G. Peano, Calcolo Geometrco secondo l Ausdehnungslehre d H. Grassmann, preceduto dalle operazon della logca deduttva, Fratell Bocca, Turn, Onlne at [4] H. A. Schwarz, Über en de Flächen klensten Flächennhalts betreffendes Problem der Varatonsrechnung, Acta Soc. Scent. Fenn. 15 (1888), [5] J. M. Steele, The Cauchy Schwarz Master Class: An Introducton to the Art of Mathematcal Inequaltes, Cambrdge Unv. Press, Cambrdge, 2004.
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 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 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 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 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 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 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 informationCSCE 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 informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
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 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 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 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 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 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 informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
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 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 informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
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 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 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 informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationThe 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 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 informationPerron 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 informationMEM 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 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 informationRepresentation 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 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 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 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 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 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 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 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 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 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 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 informationShort running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
Short runnng ttle: A generatng functon approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI JASON FULMAN Abstract. A recent paper of Church, Ellenberg,
More informationDIFFERENTIAL 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 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 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 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 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 informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationNOTES ON SIMPLIFICATION OF MATRICES
NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton
More informationRandom 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 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 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 informationw ). Then use the Cauchy-Schwartz inequality ( v w v w ).] = in R 4. Can you find a vector u 4 in R 4 such that the
Math S-b Summer 8 Homework #5 Problems due Wed, July 8: Secton 5: Gve an algebrac proof for the trangle nequalty v+ w v + w Draw a sketch [Hnt: Expand v+ w ( v+ w) ( v+ w ) hen use the Cauchy-Schwartz
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 informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
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 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 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 informationUnit 5: Quadratic Equations & Functions
Date Perod Unt 5: Quadratc Equatons & Functons DAY TOPIC 1 Modelng Data wth Quadratc Functons Factorng Quadratc Epressons 3 Solvng Quadratc Equatons 4 Comple Numbers Smplfcaton, Addton/Subtracton & Multplcaton
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 informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
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 informationMathematical Preparations
1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the
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 informationAn Inequality for the trace of matrix products, using absolute values
arxv:1106.6189v2 [math-ph] 1 Sep 2011 An Inequalty for the trace of matrx products, usng absolute values Bernhard Baumgartner 1 Fakultät für Physk, Unverstät Wen Boltzmanngasse 5, A-1090 Venna, Austra
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationLinear 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 informationALGEBRA HW 7 CLAY SHONKWILER
ALGEBRA HW 7 CLAY SHONKWILER 1 Whch of the followng rngs R are dscrete valuaton rngs? For those that are, fnd the fracton feld K = frac R, the resdue feld k = R/m (where m) s the maxmal deal), and a unformzer
More informationEigenvalues 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 informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
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 informationarxiv: 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 informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationOn 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 informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs 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 informationLecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.
prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
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 informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More information763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.
7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)
More informationBé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 informationRandić 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 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 informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
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 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 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 informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
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 informationDeriving 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 informationFirst 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 informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More information