Gupta, AnshulGustavson, FredJoshi, MaheshKarypis, GeorgeKumar, Vipin2020-09-022020-09-021997https://hdl.handle.net/11299/215322Solving large sparse systems of linear equations is at the core of many problems in engineering and scientific computing. It has long been a challenge to develop parallel formulations of sparse direct solvers due to several different complex steps involved in the process. In this paper, we describe one of the first efficient, practical, and robust parallel solvers for sparse symmetric positive definite linear systems that we have developed and discuss the algorithmic and implementation issues involved in its development.en-USReport