A general purpose sparse matrix parallel solvers package

A package of three parallel solvers with a unified user interface is developed for sparse symmetric complex linear systems arising from the discretization of partial differential equations on unstructured meshes. Once the data interface is set up, the package constructs the sparse symmetric complex matrix, and solves the linear system using one of the following methods: a bi-conjugate gradient solver, a two-stage Cholesky LDL^T factorization, or a hybrid solver combining the above two methods. The user deals only with local matrices on local mesh partitions in each processor. Scaling problem size N with the number of processors P with N/P fixed, test runs on Intel Delta up to 28 processors show that the bi-conjugate gradient method scales linearly with N whereas the hybrid method scales as √N