Large sparse matrices

Sparse matrices are matrices where most coefficients equal zero. A typical sparse matrix of size \(N\times N\) only contain \(\mathcal{O}(N)\) non-zero coefficients, which is the case with finite element matrices. Sparse matrices enjoy a moderate or even small footprint.

template<typename VALUE_TYPE>
class CooMatrix

Model for large sparse matrices.

The class CooMatrix<T> models large sparse matrices with entries of type T based on the coordinate format (COO) where only non-zero coefficients are stored in a dynamically allocated array of triplets (j,k,v) with

• j : row position

• k : column position

• v : value