This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CS 290N/219: Sparse matrix algorithms: Homework 2 Assigned October 7, 2009 Due by class time Wednesday, October 14 1. [20 points] Consider the 9vertex grid graph, numbered by rows, with the edges directed to point from lower to higher numbered vertices. Perform dfs(3,4) , that is, carry out a depthfirst search from vertices 3 and then 4. Show the postorder label assigned to each vertex. 2. [20 points] (See Davis problem 6.14.) In the leftlooking LU factorization algorithm pre sented in class on October 7, one can speed up the structureprediction step by socalled symmetric pruning , which reduces the number of edges in the depthfirstsearch graph. This speeds up the symbolic step without changing the numerical step. Thus it doesnt change the asymptotic O ( f ) running time, but in practice it typically makes the whole factorization about four times as fast. Pruning can be done in either the nopivoting ( A = LU ) or partialpivoting ( PA = LU ) version of the factorization. For this problem, you can just consider the nopivoting version. Prove that if both l jr and u rj are nonzero for some r < j , then when predicting the structure of any column k > j , the depthfirst search in G ( L T ) will still give the correct result if the search...
View
Full
Document
 Fall '09
 Chong

Click to edit the document details