A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Solving sparse linear systems is a problem that arises in many scientific applications, and sparse direct solvers are a time-consuming and key kernel for those applications and for more advanced solvers such as hybrid direct-iterative solvers. For this reason, optimizing their performance on modern architectures is critical. The preprocessing steps of sparse direct solvers-ordering and block-symbolic factorization-are two major steps that lead to a reduced amount of computation and memory anddoi:10.1137/16m1062454 fatcat:nqepemeio5f3dd3oqc7l6pmtrm