Thanks a lot for the small test case! We can reproduce the problem with it. I get same result as yours.
But the result may be expected if we consider the fact of the routinetakethe sparse matrix as square matrices by default.(Thisinfo seems be missed mkldocumentation. I will ask ourdoc developer to add such claim.).
For example, the parameter m INTEGER. Dimension of the matrix A.We give it 4 as input,
as a result, it thought the sparse matrix is 4x4.Thus, theresult matrix should be
11 ** *
1314 * *
*15 * *
ia1 INTEGER. Array of length m + 1, containing indices of elements in the array acsc, such that ia(I) is
the index in the array acsc of the first non-zero element ia1 from thecolumn I. The value of the last element ia(m + 1)
is equal to the number of non-zeros plus one.
(It is ok to explainthem as ( Value,Column,RowIndex) inCSCifthe matrix is transposed in your case)