Optimize symbolic factorization function (fill_in) #4
Description
In many cases it takes the longest.
The current algorithm does the following:
For each column i,
For each nonzero on row j
Do set_union of CSC row indices of column i and column j
EndFor
EndFor
Complexity is about O(n * (nnz/n)^2)