Parallel Sparse Cholesky Factorization with Spectral Nested Dissection Ordering

We show that the use of a new ordering computed from the spectral nested dissection (SND) algorithm leads to efficient parallel sparse Cholesky factorization on an Intel Paragon multiprocessor.