Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there a general survey on the basic algorithms for the compressed sparse rows format (like transposition, multiplication, addition, ...)? While it is not hard to write effective algorithms for that, I am not aware of any comprehensive piece of writing on these algorithmic tasks.

This does not defy that many libraries already in existence perform these operations reasonable well.

addendum: The most efficient algorithms that I am aware of generally boil down to assembling (row,column,value) triplets from the input, and building a CSR structure from this.

share|improve this question

There are chapters on this in Tim Davis' book and Yousef Saad's book on linear systems for sparse matrices. Tim Davis also has some lecture notes on his website.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.