program1

program1 - exploit sparsity and a description of your...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Program 1 Numerical Linear Algebra 1 Fall 2008 Due date: via email by 11:59PM on Monday, 9/27/10 1. Implement a conversion routine that takes a symmetric sparse matrix in coordinate form and converts it to each of the data structures below. 2. Implement a sparse matrix vector routine that computes y Ax where A R n × n is a symmetric sparse matrix. x R n and y R n are dense vectors A is stored using either of two data structures (a) modified compressed column storage that exploits the symmetry of A . (b) a modified diagonal storage scheme that exploits the symmetry of A . x and y are stored in standard one-dimensional arrays. The solution should include a description of your modifications to the data structures to
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: exploit sparsity and a description of your matrix-vector product algorithm to utilize the data structures. Comment on which of the two approaches is more readily modified for symmetric structure and the limitations of each. The solution should include the subroutine or Mfile as well as a test driver and the appropriate documentation. The test driver and documentation should include a description of the testing you did and the necessary code to repeat it. Consult the matrix market webpage given on the class webpage to find additional test matrices. 1...
View Full Document

This note was uploaded on 07/21/2011 for the course MAD 5932 taught by Professor Gallivan during the Fall '06 term at FSU.

Ask a homework question - tutors are online