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

Size: px
Start display at page:

Download "= = = (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."

Transcription

1 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 B be the rght-hand sde of the system. A ] B ] Use the Matlab command A\B to solve the system.. Enter the matrx A ]. Use the Matlab command rref to fnd the reduced row-echelon form of A. What s the soluton of the lnear system represented by the augmented matrx A?. Use the MATLAB command A\B to solve the lnear system x x x x y y y 8y z z 8z z w 8w w 8w 8. You can dsplay more sgnfcant dgts of the answer by enterng format long before solvng the system. Return to the standard format by enterng format short.. Use the Matlab command rref to determne whch of the matrces below are row-equvalent to B (a) 8 ]. ] (b) 8 ] (c) 8. Let A be the coeffcent matrx and B the rght-hand sde of the lnear system x x x x y y y y z z z 8z 8. Enter the matrces A and B, and form the augmented matrx C for ths system by usng the Matlab command C A B]. Solve the system usng rref.. The Matlab command polyft allows you to ft a polynomal of degree n to a set of n data ponts n the plane (x, y ), (x, y ),..., (x n, y n ). Fnd a fourth-degree polynomal that fts the fve data ponts of Example n Secton. by lettng x ] y ] and enterng the MATLAB command polyft(x, y, ). ]

2 Chapter Systems of Lnear Equatons. Use MATLAB to fnd a second-degree polynomal that fts the ponts (, ), (, ), (, ). 8. Use MATLAB to fnd a sxth-degree polynomal that fts the ponts (, ), (,.), (, ), (,.), (,.), (, ), (,.). The table below gves the revenues y (n bllons of dollars) for General Dynamcs Corporaton from through. (Source: General Dynamcs Corporaton) Year Revenue, y..... Use p polyft(x, y, ) to ft a fourth-degree polynomal to the data. Let x represent the year, wth x correspondng to. Then use f polyval(p, ) to estmate the revenue n. (The actual revenue n was $. bllon). Is a fourth-degree polynomal a good ft for the data? Explan.

3 Chapter Matlab Exercses Chapter Matlab Exercses. Enter the matrces A ] and B Use MATLAB to fnd (a) A B (b) B A (c) AB (d) BA.. Enter the matrces A B.... C ] ] 8 8]. ]. (a) Enter format long and then fnd A B. Return to the standard short format wth format short. (b) Fnd AC and BC. Defne what s meant by the nverse of a square matrx. What s the nverse of the matrx A? of the matrx C?. Wrte the system of lnear equatons below n the form AX B and use the matlab command A\B to solve the system. x x x y y y z z z Check your answer usng rref.. Enter the matrces A ] and B pascal(). (a) Use the matlab command trace to fnd the traces of A, B, and A B. What do you observe? (b) What s the relatonshp between the trace of AB and the trace of BA?. Use the matlab command dag to form the dagonal matrx D wth dagonal entres,,,, and. Fnd the product D DDDD. When D s an n n dagonal matrx, descrbe how to fnd the product D k for any postve nteger k.. Enter the matrces A (a) Fnd AB AC ] ] 8 B C and A(B C). What do you observe? (b) Fnd (AC), A(C), and (A)C. What do you observe?. Let ]. A Use MATLAB to fnd A, A, and A 8. Descrbe the matrx A n for large n. 8 8].

4 Chapter matrces 8. Enter the matrces A ] A zeros(, ) A (a) Form the matrx A usng the matlab constructon A A A; A A]. (b) Fnd the smallest value of n, where n s a postve nteger, such that A n A.. Use the matlab command nv to fnd the nverse of the matrx A below. Then adjon the dentty matrx I eye() to A to form the matrx B A I]. Row-reduce B to fnd the nverse of A agan. What do you observe? A ]. Let A and B be the matrces below. ] ] A B (a) Use MATLAB to fnd A B, (AB), and (BA). What do you observe? (b) Use MATLAB to fnd (A ) T and (A T ). What do you observe? Remember: The command for the transpose of a real matrx A s A.. In ths exercse, you wll use matlab to fnd the least squares regresson lne for the set of data (, ), (, ), (, ), (, ), and (, ) from Example n Secton.. (a) Form the matrces below. X ] Y ] (b) Let A (X T X) X T Y. (c) Compare your answer wth the matlab least squares command polyft. Hnt: Let X X(:, ) and enter polyft(x, Y, ). (d) Plot the data usng the matlab commands below. t (:.: ); plot(x, Y, '') (e) Plot the least squares lne for the data by usng the Matlab commands below. t (:.: ); ppolyft(x, Y, ); fpolyval(p, t); plot(t, f, * ) (f) You can combne the plots n parts (d) and (e) by usng the Matlab command plot(x, Y,, t, f, * ).. Repeat Exercse for the data (, ), (, ), (, ), (, ), (, ). Plot the data and the least squares lne on the nterval, ]. That s, use t (:.: );. ].

5 Chapter Matlab Exercses Chapter Matlab Exercses. Use Matlab to fnd the determnant of each matrx. (a) (c) pascal(). Let A ] (b) ]. (d) hllb(8) ] (a) Evaluate det( * eye() A). (b) Fnd an nteger value of t such that det(ti A).. Choose arbtrary matrces A and B. Use MATLAB to fnd det(a) det(b) and det(ab). What do you observe? Do the same for det(a) det(b) and det(a B).. Choose an arbtrary real number t. Form the matrx A cos(t) sn(t) sn(t) cos(t)] and use MATLAB to evaluate ts determnant. Does the value of the determnant depend on t?. Consder the matrces A ] and B Use MATLAB to verfy each statement. (a) det(a) det(b) det(ab) (b) det(a T ) det(a) (c) det(a ) det(a). ths exercse uses Cramer s Rule to solve the lnear system Ax b from Example n Secton.. Let A ] and b ] be the coeffcent matrx and the rght-hand sde, respectvely, of the system. To form the matrx A, replace the frst column of A wth b. To do ths, enter the commands below. A A A(:, ]) b Obtan x by enterng det(a) det(a). Obtan x n a smlar manner. A A A(:, ]) b det(a) det(a). Use the Cramer s Rule algorthm from Exercse to solve the lnear system below. Compare your answer wth that obtaned usng rref. x x x y y y z z z ].

6 Chapter Matlab Exercses Chapter Matlab Exercses. Let u (,,, ), u (,,, ), and u (,,, ). Use matlab to wrte (f possble) the vector v as a lnear combnaton of the vectors u, u, and u. (a) v (,,, ) (b) v (,,, ). Use Matlab to determne whether the gven set of vectors spans R. (a) {(,,, ), (,,, ), (,,, ), (,,, )} (b) {(,,, ), (,,, ), (,,, ), (,,, )}. Use Matlab to determne whether the set s lnearly ndependent or dependent. (a) {(,,, ), (,,, ), (,,, ), (,,, )} (b) {(,,,, ), (,,,, ), (,,,, ), (,,,, ), (,,,, )}. Use Matlab to determne whether the set of vectors forms a bass of R. (a) {(,,, ), (,,, ), (,,, ), (,,, )} (b) {(,,, ), (,,, ), (,,, ), (,,, )} (c) {(,,, ), (,,, ), (,,, ), (,,, )} (d) {(,,, ), (,,, ), (,,, ), (,,, ), (,,, )}. One way to fnd a bass for R that contans the vectors v (,,, ) and v (,,, ) s to consder the set of vectors consstng of v and v, together wth the standard bass vectors, e (,,, ), e (,,, ), e (,,, ), and e (,,, ). Let A be the matrx whose columns consst of the vectors v, v, e, e, e, and e, and apply rref to A to obtan A ] The leadng ones of the reduced matrx on the rght are n columns,,, and, so a bass for R conssts of the correspondng column vectors of A: {v, v, e, e }. a convenent way to construct the matrx A s to defne the matrx B whose columns are the gven vectors v and v. Then A s the matrx obtaned by adjonng the dentty matrx to B: A B eye()]. Use ths algorthm to fnd a bass for R that contans the vectors. (a) v (,,,, ), v (,,,, ) (b) v (,,,, ), v (,,,, ), v (,,,, ). Use Matlab to fnd a subset of the set of vectors that forms a bass for the span of the vectors. (a) {(,,, ), (,,, ), (,,, ), (,,, )} (b) {(,,,, ), (,,,, ), (,,,, ), (,,,, ), (,,,, ), (,,,, )}. Let A ] (a) Use MATLAB to fnd a bass for the row space of A. (b) Use MATLAB to fnd a bass for the column space of A. (c) Use the matlab command rank to fnd the rank of A. ].

7 Chapter vector spaces 8. Fnd a bass for the nullspace of each matrx A. Then verfy that the sum of the rank and nullty of A equals the number of columns. (a) A 8 ] (b) A hlb() (c) A pascal() (d) A magc(). Let {(,, ), (,, ), (,, )} be a (nonstandard) bass for R. You can fnd the coordnate matrx of x (,, ) relatve to ths bass by wrtng x as a lnear combnaton of the bass vectors. That s, the coordnate matrx s the soluton vector of the lnear system Bc x, where the bass vectors form the columns of B. Use MATlab to solve ths system and compare your answer to that of Example n Secton... Let B {(,, ), (,, ), (,, )} and BPRIME {(,, ), (,, ), (,, )} be the two bases of R n Example n Secton.. You can use matlab to fnd the transton matrx from B to BPRIME by frst formng the two matrces B ] and BPRIME ] Aadjon B and BPRIME by usng the matlab command C BPRIME B]. Let A be the reduced row-echelon form of C, A rref(c). Fnally, obtan PINV P by deletng the frst three columns of ths reduced matrx usng the matlab command PINV A(:, :). Fnd the transton matrx from B to BPRIME. (a) B {(, ), (, )} BPRIME {(, ), (, )} (b) B {(,,, ), (,,, ), (,,, ), (,,, )}, BPRIME {(,,, ), (,,, ), (,,, ), (,,, )}

8 Chapter Matlab Exercses Chapter Matlab Exercses. Use the MATLAB command norm(v) to fnd (a) the length of the vector v (,,,, ). (b) a unt vector n the drecton of v (,,,,, ). (c) the dstance between the vectors u (,,, ) and v (,,, ).. The dot product of the vectors (wrtten as columns) u u u un] and v v v vn] can be found usng the matrx product u v u T v u u... u n ]v v vn]. So, you can compute the dot product of u and v by multplyng the transpose of the vector u by the vector v. Let u (,,,, 8), v (,,,, ), and w (,,,, ), and use MATLAB to fnd each quantty. (a) u v (b) (u v)w (c) u (v w) (d) v v. The angle θ between two nonzero vectors can be found usng cos θ u v u v. Use MATLAB to fnd the angle between u (,, ) and v (,, ). (Hnt: Use the bult-n nverse cosne functon, acos.). You can fnd the orthogonal projecton of the column vector x onto the column vector y by evaluatng x T y y T y y. Use MATLAB to fnd each projecton of x onto y. (a) x (,, ), y (,, ) (b) x (,, ), y (,, ) (c) x (,,, ), y (,,, ). Use the MATLAB command cross(u, v) to fnd each cross product. (a) u (,, ), v (,, ) (b) u (,, ), v (,, ). Let u (,, ), v (,, ), and w (,, ). Use MATLAB to llustrate each property of the cross product lsted below. (a) u v (v u) (b) u u (c) u (v w) (u v) (u w) (d) u (v w) (u v) w

9 Chapter nner product spaces. The MATLAB command A\b fnds the least squares soluton of the lnear system of equatons Ax b. For example, f A ] and b ], then the command A\b gves..]. Use MATLAB to solve each least squares problem Ax b. (a) A (b) A (c) A ] b ] b ] ] b ] ] 8. Use MATLAB to fnd bases for the four fundamental subspaces of each matrx. (a) (c) ] (b) ] (d) ] ]

10 Chapter Matlab Exercses Chapter Matlab Exercses. Use MATLAB to fnd the kernel and range of the lnear transformaton defned by T(x) Ax for each matrx A. (a) A (b) A ] ] (c) A (d) A 8 ] ]. Let B be the upper tranglular matrx generated by the MATLAB command B tru(ones()). Let A BB T B and determne the rank and nullty of the lnear transformaton L: R R, L(x) Ax.. Use MATLAB to determne whch of the lnear transformatons defned by T(x) Ax are one-to-one and whch are onto. (a) A magc() (b) A hlb() (c) A trl(ones()). Let T: R n R m be a lnear transformaton. Let B {v, v,..., v n } and BPRIME {w, w,..., w m } be bases for R n and R m, respectvely. You can use MATLAB to fnd the matrx of T relatve to the bases B and BPRIME as outlned below. (a) Form the matrces B and BPRIME whose columns are the gven bass vectors. (b) Let A be the m n standard matrx of T. (c) Adjon BPRIME to AB to form the m (m n) matrx C: C BPRIME A B]. (d) Use rref(c) to fnd the reduced row-echelon form of C. The m n matrx composed of the rght-hand n columns of the reduced row-echelon form of C form the matrx of T relatve to the bases B and BPRIME. Use ths algorthm to fnd the matrx of each lnear transformaton relatve to the bases B and BPRIME. (a) T: R R, T(x, y) (x y, y, x), B {(, ), (, )}, BPRIME {(,, ), (,, ), (,, )} (b) T: R R, T(x, y, z) (x z, y x), B {(,, ), (,, ), (,, )}, BPRIME {(, ), (, )} (c) T: R R, T(x, y, z) (x, x y, y z, x z), B {(,, ), (,, ), (,, )}, BPRIME {(,,, ), (,,, ), (,,, ), (,,, )}. Use the results of Exercse to fnd the mage of each vector v two ways: frst by fndng T(v) Av, and second by usng the matrx of T relatve to the bases B and BPRIME. (a) v (, ) (b) v (,, ) (c) v (,, ). Let B {e, e,..., e n } and BPRIME {w, w,..., w n } be two ordered bases for R n. Recall from Secton. that you can fnd the transton matrx P from B to BPRIME as outlne below. (a) Form the matrces B and BPRIME whose columns are the bass vectors. (b) Adjon B to BPRIME, formng the n n matrx C: C BPRIME B]. (c) Let D be the reduced row-echelon form of C: D rref(c). (d) P s the n n matrx consstng of the rght-hand n columns of D. Use MATLAB to fnd the matrx APRIME for the lnear transformaton T: R n R n relatve to the bass BPRIME. (a) T: R R, T(x, y) (x y, y x) BPRIME {(, ), (, )} (b) T: R R, T(x, y, z) (x, x y, x y z), BPRIME {(,, ), (,, ), (,, )}

11 Chapter lnear transformatons. Let B {(,, ), (,, ), (,, )} and BPRIME {(,, ), (,, ), (,, )} be bases for R, and let A ] be the matrx of T: R R relatve to B, the standard bass. Use MATLAB to answer parts (a) (e) below. (a) Fnd the transton matrx P from BPRIME to B. (b) Fnd the transton matrx P from B to BPRIME. (c) Fnd APRIME, the matrx for T relatve to BPRIME. (d) Let v] BPRIME ] and fnd v] B and T(v)] B. (e) Fnd T(v)] BPRIME two ways: frst as P T(v)] B and then as APRIMEv] BPRIME.

12 Chapter Matlab Exercses Chapter Matlab Exercses. The MATLAB command poly(a) produces the coeffcents of the characterstc polynomal of the square matrx A, begnnng wth the hghest degree term. Fnd the characterstc polynomal of each matrx. (a) A (b) A (c) A ] ] 8 ]. If you set p poly(a), then the command roots(p) determnes the roots of the characterstc polynomal of the matrx A. Use these commands to fnd the egenvalues of the matrces n Exercse.. The matlab command V D] eg(a) produces a dagonal matrx D contanng the egenvalues of A on the dagonal and a matrx V whose columns are the correspondng egenvectors. Use ths command to fnd the egenvalues and correspondng egenvectors of the three matrces n Exercse.. Let A ]. Use matlab to fnd the egenvalues and correspondng egenvectors of A, A T, and A. What do you observe?. Let A ]. Use matlab to dagonalze A. Frst, compute the egenvalues and egenvectors of A usng the command P D] eg(a). The dagonal matrx D contans the egenvalues of A, and the correspondng egenvectors form the columns of P. Verfy that P dagonalzes A by showng that P AP D.. Follow the procedure outlned n Exercse to show that the matrx A ] s not dagonalzable.. Follow the procedure outlned n Exercse to dagonalze (f possble) each matrx. (a) A (b) A (c) A ] ] 8 ]

13 Chapter Egenvalues and egenvectors 8. For a symmetrc matrx A, the matlab command P D] eg(a) produces a dagonal matrx D contanng the egenvalues of A and an orthogonal matrx P contanng the correspondng egenvectors. For example, usng the matrx A from Example 8 n Secton., A ] and the command P D] eg(a), yelds P.8...8] and D whch s equvalent to the soluton n the text. Use ths procedure to orthogonally dagonalze each symmetrc matrx. (a) A (b) A ] ] ],

14 Chapter 8 Matlab Exercses 8 Chapter 8 Matlab Exercses MATLAB handles complex numbers and matrces n much the same way that t handles real numbers and matrces. The magnary unt s a bult-n constant.. Verfy the result of Example n Secton 8. by enterng the matrx A, A ; ] and then enterng nv(a).. In MATLAB, A. desgnates the transpose A T of a complex matrx A. If you do not nclude the perod, then MATLAB returns the conjugate transpose A*. Use MATLAB to verfy each statement usng the matrx A from Example n Secton 8.. (a) A. ] (b) A ]. Use MATLAB to perform the matrx operatons below, where A ], B ], and C ]. (a) AB (b) C (c) A (d) C T C (e) det(a B) (f) AB ( )CC T. Use MATLAB to solve each system of lnear equatons Ax b. (a) A ], b ] (b) A ], b ]. Use MATLAB to determne whch of the matrces below are Hermtan and whch are normal. (a) (c) ] (b) ] (b) ] ]. The MATLAB command P D] eg(a) produces a dagonal matrx D contanng the egenvalues of the complex matrx A, and a matrx P contanng the correspondng egenvectors. For example, usng the matrx A from Example n Secton 8., A ] and the command P D] eg(a), yelds.8. P..8.. and D ], ] whch s equvalent to the soluton gven n the text. Use ths procedure to dagonalze each matrx. Verfy that P dagonalzes A by showng that P AP D. (a) A ] (b) A ] (c) ]

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

332600_08_1.qxp 4/17/08 11:29 AM Page 481

332600_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 information

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

Formulas for the Determinant

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

Quantum Mechanics I - Session 4

Quantum 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

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

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

w ). 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

w ). 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 information

Homework Notes Week 7

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

C/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/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 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

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

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

Difference Equations

Difference 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 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

8.6 The Complex Number System

8.6 The Complex Number System 8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want

More 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

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

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

Quantum Mechanics for Scientists and Engineers. David Miller

Quantum Mechanics for Scientists and Engineers. David Miller Quantum Mechancs for Scentsts and Engneers Davd Mller Types of lnear operators Types of lnear operators Blnear expanson of operators Blnear expanson of lnear operators We know that we can expand functons

More information

Feb 14: Spatial analysis of data fields

Feb 14: Spatial analysis of data fields Feb 4: Spatal analyss of data felds Mappng rregularly sampled data onto a regular grd Many analyss technques for geophyscal data requre the data be located at regular ntervals n space and/or tme. hs s

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

Section 8.3 Polar Form of Complex Numbers

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

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as:

This model contains two bonds per unit cell (one along the x-direction and the other along y). So we can rewrite the Hamiltonian as: 1 Problem set #1 1.1. A one-band model on a square lattce Fg. 1 Consder a square lattce wth only nearest-neghbor hoppngs (as shown n the fgure above): H t, j a a j (1.1) where,j stands for nearest neghbors

More information

Problem Set 9 Solutions

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

Complex Numbers Alpha, Round 1 Test #123

Complex Numbers Alpha, Round 1 Test #123 Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test

More 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

1 Vectors over the complex numbers

1 Vectors over the complex numbers Vectors for quantum mechancs 1 D. E. Soper 2 Unversty of Oregon 5 October 2011 I offer here some background for Chapter 1 of J. J. Sakura, Modern Quantum Mechancs. 1 Vectors over the complex numbers What

More information

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

763622S 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 information

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

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

Composite Hypotheses testing

Composite 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 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

CSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography

CSci 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 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

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

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

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values Fall 007 Soluton to Mdterm Examnaton STAT 7 Dr. Goel. [0 ponts] For the general lnear model = X + ε, wth uncorrelated errors havng mean zero and varance σ, suppose that the desgn matrx X s not necessarly

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

1 Matrix representations of canonical matrices

1 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 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

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

Fall 2012 Analysis of Experimental Measurements B. Eisenstein/rev. S. Errede

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

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?

Problem Do any of the following determine homomorphisms from GL n (C) to GL n (C)? Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2

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

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,

More information

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX

A FORMULA FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIAGONAL MATRIX Hacettepe Journal of Mathematcs and Statstcs Volume 393 0 35 33 FORMUL FOR COMPUTING INTEGER POWERS FOR ONE TYPE OF TRIDIGONL MTRIX H Kıyak I Gürses F Yılmaz and D Bozkurt Receved :08 :009 : ccepted 5

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

MTH 263 Practice Test #1 Spring 1999

MTH 263 Practice Test #1 Spring 1999 Pat Ross MTH 6 Practce Test # Sprng 999 Name. Fnd the area of the regon bounded by the graph r =acos (θ). Observe: Ths s a crcle of radus a, for r =acos (θ) r =a ³ x r r =ax x + y =ax x ax + y =0 x ax

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

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

The Geometry of Logit and Probit

The Geometry of Logit and Probit The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.

More information

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

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

Norm Bounds for a Transformed Activity Level. Vector in Sraffian Systems: A Dual Exercise

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

NOTES ON SIMPLIFICATION OF MATRICES

NOTES 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 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

(A and B must have the same dmensons to be able to add them together.) Addton s commutatve and assocatve, just lke regular addton. A matrx A multpled

(A and B must have the same dmensons to be able to add them together.) Addton s commutatve and assocatve, just lke regular addton. A matrx A multpled CNS 185: A Bref Revew of Lnear Algebra An understandng of lnear algebra s crtcal as a steppng-o pont for understandng neural networks. Ths handout ncludes basc dentons, then quckly progresses to elementary

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

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

Advanced Quantum Mechanics

Advanced Quantum Mechanics Advanced Quantum Mechancs Rajdeep Sensarma! sensarma@theory.tfr.res.n ecture #9 QM of Relatvstc Partcles Recap of ast Class Scalar Felds and orentz nvarant actons Complex Scalar Feld and Charge conjugaton

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

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

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng

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

Ph 219a/CS 219a. Exercises Due: Wednesday 23 October 2013

Ph 219a/CS 219a. Exercises Due: Wednesday 23 October 2013 1 Ph 219a/CS 219a Exercses Due: Wednesday 23 October 2013 1.1 How far apart are two quantum states? Consder two quantum states descrbed by densty operators ρ and ρ n an N-dmensonal Hlbert space, and consder

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

2 More examples with details

2 More examples with details Physcs 129b Lecture 3 Caltech, 01/15/19 2 More examples wth detals 2.3 The permutaton group n = 4 S 4 contans 4! = 24 elements. One s the dentty e. Sx of them are exchange of two objects (, j) ( to j and

More information

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q For orthogonal curvlnear coordnates, eˆ grad a a= ( aˆ ˆ e). h q (98) Expandng the dervatve, we have, eˆ aˆ ˆ e a= ˆ ˆ a h e + q q 1 aˆ ˆ ˆ a e = ee ˆˆ ˆ + e. h q h q Now expandng eˆ / q (some of the detals

More information

Linear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.

Linear, 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 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

BACKGROUND: WEAK CONVERGENCE, LINEAR ALGEBRA 1. WEAK CONVERGENCE

BACKGROUND: WEAK CONVERGENCE, LINEAR ALGEBRA 1. WEAK CONVERGENCE BACKGROUND: WEAK CONVERGENCE, LINEAR ALGEBRA 1. WEAK CONVERGENCE Defnton 1. Let (X,d) be a complete, separable metrc space (also known as a Polsh space). The Borel σ algebra on X s the mnmal σ algebra

More information

THEOREMS OF QUANTUM MECHANICS

THEOREMS 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

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

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)

Some Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS) Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998

More information

Errata to Invariant Theory with Applications January 28, 2017

Errata to Invariant Theory with Applications January 28, 2017 Invarant Theory wth Applcatons Jan Drasma and Don Gjswjt http: //www.wn.tue.nl/~jdrasma/teachng/nvtheory0910/lecturenotes12.pdf verson of 7 December 2009 Errata and addenda by Darj Grnberg The followng

More information

Computing π with Bouncing Balls

Computing π with Bouncing Balls by Let the mass of two balls be M and m, where M = (6 n )m for n N. The larger ball s rolled towards the lghter ball, whch ear a wall and ntally at rest. Fnd the number of collsons between the two balls

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

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

Unit 5: Quadratic Equations & Functions

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

C4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z )

C4B Machine Learning Answers II. = σ(z) (1 σ(z)) 1 1 e z. e z = σ(1 σ) (1 + e z ) C4B Machne Learnng Answers II.(a) Show that for the logstc sgmod functon dσ(z) dz = σ(z) ( σ(z)) A. Zsserman, Hlary Term 20 Start from the defnton of σ(z) Note that Then σ(z) = σ = dσ(z) dz = + e z e z

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

Least Squares Fitting of Data

Least Squares Fitting of Data Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng

More information

Linear Approximation with Regularization and Moving Least Squares

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

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Bezier 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 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

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions

PHYS 215C: Quantum Mechanics (Spring 2017) Problem Set 3 Solutions PHYS 5C: Quantum Mechancs Sprng 07 Problem Set 3 Solutons Prof. Matthew Fsher Solutons prepared by: Chatanya Murthy and James Sully June 4, 07 Please let me know f you encounter any typos n the solutons.

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

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

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD

CHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD CHALMERS, GÖTEBORGS UNIVERSITET SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS COURSE CODES: FFR 35, FIM 72 GU, PhD Tme: Place: Teachers: Allowed materal: Not allowed: January 2, 28, at 8 3 2 3 SB

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

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed points of IA-endomorphisms of a free metabelian Lie algebra Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ

More information

Structure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7

Structure from Motion. Forsyth&Ponce: Chap. 12 and 13 Szeliski: Chap. 7 Structure from Moton Forsyth&once: Chap. 2 and 3 Szelsk: Chap. 7 Introducton to Structure from Moton Forsyth&once: Chap. 2 Szelsk: Chap. 7 Structure from Moton Intro he Reconstructon roblem p 3?? p p 2

More information

10-701/ Machine Learning, Fall 2005 Homework 3

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

Section 3.6 Complex Zeros

Section 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 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

p 1 c 2 + p 2 c 2 + p 3 c p m c 2

p 1 c 2 + p 2 c 2 + p 3 c p m c 2 Where to put a faclty? Gven locatons p 1,..., p m n R n of m houses, want to choose a locaton c n R n for the fre staton. Want c to be as close as possble to all the house. We know how to measure dstance

More information

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order: 68A Solutons to Exercses March 05 (a) Usng a Taylor expanson, and notng that n 0 for all n >, ( + ) ( + ( ) + ) We can t nvert / because there s no Taylor expanson around 0 Lets try to calculate the nverse

More information

ψ = i c i u i c i a i b i u i = i b 0 0 b 0 0

ψ = i c i u i c i a i b i u i = i b 0 0 b 0 0 Quantum Mechancs, Advanced Course FMFN/FYSN7 Solutons Sheet Soluton. Lets denote the two operators by  and ˆB, the set of egenstates by { u }, and the egenvalues as  u = a u and ˆB u = b u. Snce the

More information

Statistics MINITAB - Lab 2

Statistics MINITAB - Lab 2 Statstcs 20080 MINITAB - Lab 2 1. Smple Lnear Regresson In smple lnear regresson we attempt to model a lnear relatonshp between two varables wth a straght lne and make statstcal nferences concernng that

More information

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics ) Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information