Learning Fill-in Reduction Ordering via Graph Policy Optimization for Sparse Matrices
arXiv:2605.17362v1 Announce Type: new Abstract: Matrix reordering in large sparse solvers seeks a permutation that minimizes factorization fill-in to reduce memory and computation. Because the minimum