, Speedup Full-rank Minimal-Memory/? =10 ?8 Minimal-Memory/? =10 ?4 Just-In-Time/? =10 ?8 Just-In-Time/? =10 ?4
, , vol.42, p.35
,
, Order S with larger numbers: VA < VB < VS
, Apply the process recursively on A and B As A and B are processed independently, their contribution on S is not symmetric Current solutions in sparse low-rank solvers ? Find low-rank clustering by applying a k-way partitioning on each separator
, ? Reordering strategy to cluster close contributions (PaStiX, and cf
, , vol.45, p.35