Final_1806_s05 - 18.06 Professor Strang Final Exam Grading 1 Your PRINTED name is Closed book 10 wonderful problems Thank you for taking this

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

View Full Document Right Arrow Icon
1 2 3 4 5 6 7 8 9 10 18.06 Professor Strang Final Exam May 16, 2005 Grading Your PRINTED name is: Closed book / 10 wonderful problems. Thank you for taking this course ! There is an extra blank page at the end.
Background image of page 1

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

View Full DocumentRight Arrow Icon
1( 1 0 p t s . ) Suppose P 1 ,...,P n are points in R n . The coordinates of P i are ( a i 1 ,a i 2 ,...,a in ). We want to find a hyperplane c 1 x 1 + ··· + c n x n = 1 that contains all n points P i . (a) What system of equations would you solve to find the c ’s for that hyperplane ? (b) Give an example in R 3 where no such hyperplane exists (of this form), and an example which allows more than one hyperplane of this form. (c) Under what conditions on the points or their coordinates is there not a unique interpolating hyperplane with this equation ? 2
Background image of page 2
2( 1 0 p t s . ) (a) Find a complete set of “special solutions” to Ax = 0 by noticing the pivot variables and free variables (those have values 1 or 0). 12345 A = 12346 . 00000 (b) and (c) Prove that those special solutions are a basis for the nullspace N ( A ).
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 01/14/2011 for the course EECS 18.06 taught by Professor Strang during the Spring '05 term at University of Michigan.

Page1 / 12

Final_1806_s05 - 18.06 Professor Strang Final Exam Grading 1 Your PRINTED name is Closed book 10 wonderful problems Thank you for taking this

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