This subroutine takes as input a sparse matrix (rank [n]) in an uncompressed yale format [uc_list], as a rectangular matrix ([n] x max_el_per_row) and the actual number of items [nit] for each row (remaining elements are not considered) and compress in a Yale format sparse matrix [s]. The task is parallelized to handle large matrices.
Type | Intent | Optional | Attributes | Name | ||
---|---|---|---|---|---|---|
integer(kind=ip), | intent(in) | :: | n |
Rank of matrix |
||
integer(kind=ip), | intent(in) | :: | uc_list(:,:) |
Uncompressed list/boolean sparse matrix |
||
integer(kind=ip), | intent(in) | :: | nit(n) |
Number of elements for each row of [uc_list] |
||
type(yale_sparse), | intent(out) | :: | s |
Output sparse matrix |