Scientific Computing

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

View Full Document Right Arrow Icon
CS205 Homework #7 Problem 1 We have seen the application of the conjugate gradient algorithm on the solution of sym- metric, positive definite systems. Now assume that in the system Ax = b , the n × n matrix A is symmetric positive semi-definite with a nullspace of dimension p < n . This problem illustrates that one can use a modified version of conjugate gradients to solve this system as well. 1. Prove that we can write A as A = M ˜ AM T where M is an n × ( n - p ) matrix with orthonormal columns that form a basis for the column space of A , while ˜ A is an ( n - p ) × ( n - p ) symmetric positive definite matrix (no nullspace) [Hint: Use the diagonal form of A = QΛQ T ] 2. Let the n × n matrix P be defined as P = MM T . Explain (no formal proof required) why this is a projection matrix and onto what space it projects. How can we compute P without knowledge of the eigenvalues-eigenvectors of A ? 3. Show that, in order to have a solution to
Background image of page 1

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

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

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

Page1 / 3

hw7 - CS205 Homework#7 Problem 1 We have seen the...

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