Sparse Vectors and Matrices

In many applications, the majority of the elements of a matrix are zero. Such a matrix is called a sparse matrix. Similarly, a vector with mostly zero elements is called a sparse vector. Taking advantage of sparsity can save memory and computing time.

Numerics.NET contains a series of classes for working with sparse vectors and matrices. These classes live in the Extreme.Mathematics.LinearAlgebra namespace.

In this section:

• Sparse Vectors
• Sparse Matrices
• Solving Sparse Systems