论文部分内容阅读
We present an efficient code for solving large sparse linear systems using the multifrontal method with hierarchically semi-separable(HSS)matrices.The low rank compression in HSS limits fill-in and reduces complexity of the solver.The HSS matrices are constructed using randomized sampling and rank-revealing QR.ULV decomposition replaces the traditional dense LU.The factorization acts as solver or preconditioner.Shared and distributed memory parallel results are presented for a range of applications