# hw03 - CS170 Spring 2010 Problem Set 3 Out Feb 5 2010 Due...

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

CS170 - Spring 2010 Problem Set 3 Out: Feb 5, 2010 Due: Feb 12, 2010, 4pm Please write your name, your student ID number, course name (CS170), homework number (this is HW#1), your TA’s name and your section number on the ﬁrst page of all of your homeworks, and staple all the pages together. Please put your name, CS170 and homework number on all the pages (in case they get separated). Note DPV = Dasgupta, Papadimitriou, Vazirani refers to the textbook. So DPV 2.5 refers to Problem 5 in Chapter 2 of DPV. 1. DPV 2.7 2. DPV 2.9 3. DPV 2.30 4. We will show how to use a fast matrix multiplication algorithm (like Strassen’s method) to invert triangular matrices equally fast. A matrix T is upper triangular if all its entries below the main diagonal are zero, and also invertible if all its diagonal entries are nonzero. Assume T is n -by- n where for simplicity n is a power of 2. (a) Let T = " T 11 T 12 0 T 22 # where each subblock T ij is square with dimension n/ 2. Verify (by multiplying out

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 3

hw03 - CS170 Spring 2010 Problem Set 3 Out Feb 5 2010 Due...

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

View Full Document
Ask a homework question - tutors are online