DataStructuresAndMatMul

DataStructuresAndMatMul - CS 219 Administrivia: Sep 30,...

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

View Full Document Right Arrow Icon
CS 219 Administrivia: Sep 30, 2009 CS 219 Administrivia: Sep 30, 2009 Course web site: www.cs.ucsb.edu/~gilbert/cs290 Join the email (Google) discussion group!! (see web site) Homework 1 is due next Wednesday (see web site) Reading in Davis: Review Ch 1 (definitions) Skim Ch 2 (you don't have to read all the code in detail) Read Chapter 3 (sparse triangular solves) Roxanne in HFH 5102 has a few copies of Davis for sale
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Compressed Sparse Matrix Storage Compressed Sparse Matrix Storage Full storage: 2-dimensional array. (nrows*ncols) memory. 31 0 53 0 59 0 41 26 0 31 41 59 26 53 1 3 2 3 1 Sparse storage: Compressed storage by columns (CSC). Three 1-dimensional arrays. (2*nzs + ncols + 1) memory. Similarly, CSR. 1 3 5 6 value: row: colstart:
Background image of page 2
Matrix – Matrix Multiplication: C = A * B Matrix – Matrix Multiplication: C = A * B C(:, :) = 0; for i = 1:n for j = 1:n for k = 1:n C(i, j) = C(i, j) + A(i, k) * B(k, j); The n 3 scalar updates can be done in any order. Six possible algorithms:
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/27/2011 for the course CMPSC 290h taught by Professor Chong during the Fall '09 term at UCSB.

Page1 / 7

DataStructuresAndMatMul - CS 219 Administrivia: Sep 30,...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online