# hw1 - CS 290N CS 219 Sparse Matrix Algorithms Homework 1...

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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 290N / CS 219: Sparse Matrix Algorithms // Homework 1 Due by class time Wednesday, October 7 Please turn in all your homework on paper, either in class or in the homework box in the Computer Science Department office. For programs, turn in (1) code listing; (2) sample output and any plots, showing thorough testing; (3) a transcript of a Matlab session showing how it’s used. Problem 1. [10 points] Let A and B be two n-by- n matrices. Show that the number of nonzero scalar multiplications required to compute C = AB is (using Matlab notation) n summationdisplay i =1 nnz ( A (: , i )) * nnz ( B ( i , :)) . Problem 2. [30 points] Let G be the 9-vertex “grid graph” corresponding to the two- dimensional model problem on a 3-by-3 mesh. Suppose the vertices of G are numbered 1 through 9 by rows from upper left to bottom right. 2(a) [5 points] Draw the sequence of ten so-called “elimination graphs” (beginning with G and ending with the empty graph) that result from playing the vertex elimination game on G with the given vertex numbering....
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

hw1 - CS 290N CS 219 Sparse Matrix Algorithms Homework 1...

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

View Full Document
Ask a homework question - tutors are online