midterm1 fall07

Scientific Computing

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: CS 205A Fall 2007 Midterm Multiple Choice (8 x 1 pt) 1. For a symmetric ( A = A T ) n × n matrix A , (a) A T A is invertible (b) The eigenvalues are all real-valued (c) For any b , there exists an x such that Ax = b (d) There exist non-singular matrices L and U such that A = LU 2. If we’re given a matrix A , the following can be said: (a) If A is positive definite, then it has Cholesky Factors (ie A = LL T ) (b) If A is over-determined, we use QR decomposition with Householder to solve Ax = b (c) The pseudo-inverse of A , A + = V Σ + U T can be used to solve least-squares problems (d) Solving the minimization problem min x k b- Ax k 2 is equivalent to solving Ax = b 3. The following can be said about a Householder Matrix H = I- 2 vv T v T v (a) The condition number for H is ∞ (b) It is a projection matrix onto the hyperplane orthogonal to v (c) It preserves the 2-norm of a vector (ie k x k 2 = k Hx k 2 for all x ) (d) The eigenvalues of H are 1 with multiplicity n 4. Consider the multi-variate optimization problem min4....
View Full Document

This note was uploaded on 01/29/2008 for the course CS 205A taught by Professor Fedkiw during the Fall '07 term at Stanford.

Page1 / 5

midterm1 fall07 - CS 205A Fall 2007 Midterm Multiple...

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

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