csr 矩阵 编码_CSR矩阵 - 矩阵乘法

I have two square matrices A and B

I must convert B to CSR Format and determine the product C

A * B_csr = C

I have found a lot of information online regarding CSR Matrix - Vector multiplication. The algorithm is:

for (k = 0; k < N; k = k + 1)

result[i] = 0;

for (i = 0; i < N; i = i + 1)

{

for (k = RowPtr[i]; k < RowPtr[i+1]; k = k + 1)

{

result[i] = result[i] + Val[k]*d[Col[k]];

}

}

However, I require Matrix - Matrix multiplication.

Further, it seems that most algorithms apply A_csr - vector multiplication where I require A * B_csr. My solution is to transpose the two matrices before converting then transpose the final product.

Can someone explain how to compute a Matrix - CSR Matrix product an