quiz2solutions

quiz2solutions - MIT OpenCourseWare http:/ocw.mit.edu...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
MIT OpenCourseWare http://ocw.mit.edu 18.085 Computational Science and Engineering I Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
18.085 Quiz 2 November 2, 2007 Professor Strang Your PRINTED name is: Grading 1 2 3 1) (40 pts.) This problem is based on a 5-node graph. I have not included edge numbers and arrows. Add them if you want to: not needed. (a) Find A T A for this graph. A is the incidence matrix. (b) The sum of the eigenvalues of A T A is . The product of those eigenvalues is . (c) What is A T A for a graph with only one edge ? How can that small A T A be used in constructing A T A for a large graph ? (d) Suppose I want to solve Au = ones(8 , 1) = b by least squares. What equation gives a best u ? For the incidence matrix A , is there exactly one best u solving that equation ? (If your equation has more than one best u , describe the difference between any two solutions.) 1 2 3 4 5 1
Background image of page 2
c a The matrix A t A is the graph Laplacian, given by D W were D is the degree matrix and W is the adjacency matrix. Therefore it is a 5 × 5 matrix: 3 1 1 0 1 1 3 0 1 1 1 0 3 1 1 0 1 1 3 1 1 1 1 1 4 b The trace of A t A is the sum of the diagonal entries, so 16. The determinant is the product of the eigenvalues. Since any graph Laplacian has a null-vector (namely any constant vector), one of the eigenvalues is 0, so the determinant is also 0. The A t A for a one edge graph i 1 1 1 1 To construct A t A for a larger graph from these element matrices, we construct one for each edge of the graph and add them together according to the following scheme. If there are n nodes, start with an n × n matrix of zeroes M . Then, for an edge connecting node i to node j , add 1 to M ii and M jj and 1 to M ij and M ji . Do this for each edge and the end result
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/12/2011 for the course MATH 18.085 taught by Professor Staff during the Fall '10 term at MIT.

Page1 / 11

quiz2solutions - MIT OpenCourseWare http:/ocw.mit.edu...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online