C#中是否存在任何存储优化的稀疏矩阵实现？

using System;

public class SparseMatrix
{
    private int rows;
    private int cols;
    private int[] values;
    private int[] columnIndices;
    private int[] rowPointers;

    public SparseMatrix(int rows, int cols)
    {
        this.rows = rows;
        this.cols = cols;
        this.values = new int[rows * cols];
        this.columnIndices = new int[rows * cols];
        this.rowPointers = new int[rows + 1];
    }

    public void SetValue(int row, int col, int value)
    {
        int index = rowPointers[row] + col;
        values[index] = value;
        columnIndices[index] = col;
    }

    public int GetValue(int row, int col)
    {
        int index = rowPointers[row] + col;
        return values[index];
    }

    public void BuildRowPointers()
    {
        int currentIndex = 0;
        for (int i = 0; i< rows; i++)
        {
            rowPointers[i] = currentIndex;
            for (int j = 0; j< cols; j++)
            {
                if (values[currentIndex] != 0)
                {
                    currentIndex++;
                }
            }
        }
        rowPointers[rows] = currentIndex;
    }
}

public class Program
{
    public static void Main(string[] args)
    {
        SparseMatrix matrix = new SparseMatrix(3, 4);
        matrix.SetValue(0, 0, 1);
        matrix.SetValue(0, 2, 2);
        matrix.SetValue(1, 1, 3);
        matrix.SetValue(2, 3, 4);
        matrix.BuildRowPointers();

        Console.WriteLine("Matrix:");
        for (int i = 0; i< matrix.rows; i++)
        {
            for (int j = 0; j< matrix.cols; j++)
            {
                Console.Write(matrix.GetValue(i, j) + " ");
            }
            Console.WriteLine();
        }
    }
}