Blocking strategy optimizations for sparse direct linear solver on heterogeneous architectures
In the context of solving sparse linear systems, an ordering process partitions the matrix graph to minimize both fill-in and computational cost. We found that the ordering …