- [x] Prepare sparse L factor as benchmark dataset - [x] Benchmark [Intel SpMP trsv kernel](https://github.com/IntelLabs/SpMP/blob/master/test/trsv_test.cpp#L345) as multi-threaded performance baseline for *level-schedule* algorithm - [x] Benchmark [Kokkos sptrsv kernel](https://github.com/kokkos/kokkos-kernels/blob/3.6.01/src/sparse/KokkosSparse_sptrsv_supernode.hpp) as multi-threaded performance baseline for *partitioned-inverse* algorithm - [ ] Internal code design for level-schedule algorithm. [AMGCL's ILU solve](https://github.com/ddemidov/amgcl/blob/1.4.3/amgcl/relaxation/detail/ilu_solve.hpp#L251) is a relatively simple reference. - [ ] Internal code design for partitioned-inverse algorithm - [ ] High-level sptrsv API that is "in harmony with" existing GraphBLAS/ALP API and data structures - [ ] End-to-end PCG benchmark with incomplete factorization preconditioner