1-PA-dueOct2 - CSC 3102 Programming Assignment 1: Sparse...

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

View Full Document Right Arrow Icon
CSC 3102 Programming Assignment 1: Sparse Matrix Transpose Due: October 2, Thursday (by 11:55 pm) Points: 5 Penalty: You will lose one point per delayed day Submit your work as instructed towards the end of this document. Contact the teaching assistant Di Lin by e-mail to dlin4@lsu.edu for help. Objective: To empirically demonstrate the difference in performance between the naive (brute-force) and fast-transpose algorithms on sparse matrices. Definition: A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, for every linear transformation, there exists exactly one corresponding matrix, and every matrix corresponds to a unique linear transformation. Matrices have wide-ranging applications in such areas as image processing, information retrieval, computer graphics, scientific visualization, dynamical systems, etc. In this assignment, you are dealing with the sparse matrix of order n , which has only a small number ( t ) of non-zero elements. In the class, we have learned how a sparse matrix is represented as a set of order triplets and also learned about two algorithms for obtaining its transpose (see the lecture notes). The time-efficiency of the brute-force transpose algorithm is
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 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.

Page1 / 3

1-PA-dueOct2 - CSC 3102 Programming Assignment 1: Sparse...

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