SparseMatrix<T> Class

public abstract class SparseMatrix<T> : Matrix<T>

Public MustInherit Class SparseMatrix(Of T)
	Inherits Matrix(Of T)

generic<typename T>
public ref class SparseMatrix abstract : public Matrix<T>

[<AbstractClassAttribute>]
type SparseMatrix<'T> = 
    class
        inherit Matrix<'T>
    end

Inheritance

Object  →  LinearOperator<T>  →  Matrix<T>  →  SparseMatrix<T>

Derived

Extreme.Mathematics.LinearAlgebra.SparseCompressedColumnMatrix<T>

Type Parameters

T

Use the SparseMatrix<T> class to represent matrices with only a small proportion of nonzero components. Only the nonzero elements of the matrix are stored. This not only saves memory, but also allows many calculations to be performed faster.

The components of a sparse matrix can be specified in a variety of ways. A common method is to supply the rows, columns, and values of the nonzero components. Another way is to build up the matrix using the

Insert

Sparse matrices can also be read directly from data files in Matrix Market format.

The NonzeroCount property returns the number of nonzero components. The FillFactor property returns a number between 0 and 1 that is the proportion of nonzero components to the total number of components in the matrix. To iterate through the nonzero components of a sparse matrix, use the NonzeroElements property. This property enumerates RowColumnValueTriplet<T> objects, each containing the row, column, and value of a nonzero component.

A disadvantage of sparse matrices is that working with individual components tends to be slower. Every access usually requires a lookup in a list. To avoid duplicate lookups for elementary operations on components, use one of the specialized methods: AddAt(Int32, Int32, T), SubtractAt(Int32, Int32, T), MultiplyAt(Int32, Int32, T) and DivideAt(Int32, Int32, T).

Reference