quiz2f07 - MIT OpenCourseWare http/ocw.mit.edu 18.085...

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
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background 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 / 4

quiz2f07 - MIT OpenCourseWare http/ocw.mit.edu 18.085...

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