Linear Combinations of Sparse Vectors

Event Sponsor: 
LANS Informal Seminar
Start Date: 
Jul 25 2007 (All day)
Building 221, A-261
Duc Nguyen
Speaker(s) Title: 

Finding the derivative of a function is a common task in scientific applications. Inside that process, finding a combination of vectors is the core operation and needs to be implemented efficiently. In many cases, the vectors are sparse and can be computed much more efficiently than the dense vectors if we use specialized functions. My job this summer is to develop SparsLinC, a library written in C for computing combinations of sparse vectors in linear time, and integrate it with automatic differentiation tools such as ADIC Automatic Differentiation in C). In my presentation, I will give a short introduction about ADIC, my current implementation of sparsLinC, and its performance.

Miscellaneous Information: