hw1 - CIS 6930/4930 Sparse matrix algo Project 1 Timothy A...

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

View Full Document Right Arrow Icon
CIS 6930/4930: Sparse matrix algo.: Project 1 Timothy A. Davis Computer and Information Science and Engineering Department, University of Florida. email: [email protected]fl.edu. http://www.cise.ufl.edu/ davis. Spring 2010 1 Policies Assigned Wednesday, Jan 13. Due Friday, Jan 22. Turn in a zip file with a modified version of CSparse. Modify cs make as necessary to compile your mexFunctions. Note that for each project, it is vital that you start with a fresh copy of CSparse (unless instructed otherwise). Otherwise, your code may fail when I try to compile it (if it relies on code from an earlier project, for example). You may not look at any other student’s code. Do not put your student ID on anything you turn in to me. 2 Problem (A) Do Problem 2.1 in the book. 3 Problem (B) Write a function cs taxpy which computes z=A*x+y where x, y, and z are dense vectors, and A is a sparse matrix in triplet form. Your code should pass the following test with errors around 1e-16 or so: problems = [449 262] ; nprobs = length (problems) ; 1
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 note was uploaded on 01/15/2012 for the course CIS 4930 taught by Professor Staff during the Spring '08 term at University of Florida.

Page1 / 3

hw1 - CIS 6930/4930 Sparse matrix algo Project 1 Timothy A...

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