Sparse matrix class with efficient successive insertion of entries.
Without an intermediate data structure, efficient successive insertion/update of entries in random order into a standard compressed colume storage structure appears to be not possible. The package introduces ExtendableSparseMatrix, a delegating wrapper around the Julia standard SparseMatrixCSC struct which contains an additional linked list based (but realised in vectors) temporary extension structure.
ExtendableSparseMatrix is aimed to work as a drop-in replacement to SparseMatrixCSC in finite element and finite volume codes.
Currently it has the methods required for AbstractSparseMatrix (getindex, setindex!,size,nnz), as well as lufact and mul!, which is already sufficient for a number of interesting applications.