We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve unsymmetric linear systems. We introduce the notion of unsymmetric supernodesâ€¦ (More)

Two techniques are introduced to reduce the working storage requirement for the recent multifrontal method of Duff and Reid used in the sparse out-of-core factorization of symmetric matrices. For aâ€¦ (More)

In this paper, a systematic and unified treatment of computational task models for parallel sparse Cholesky factorization is presented. They are classified as fine-, medium-, and large-grained graphâ€¦ (More)

A heuristic graph partitioning scheme is presented to determine effective node separators for undirected graphs. An initial separator is first obtained from the minimum degree ordering, an algorithmâ€¦ (More)

We consider the problem of finding equivalent reorderings of a sparse matrix so that the reordered matrix is suitable for parallel Ganssian elimination. The elimination tree structure is used as ourâ€¦ (More)

This paper presents a column-oriented distributed algorithm for factoring a large sparse symmetric positive definite matrix on a local-memory parallel processor. Processors cooperate in computingâ€¦ (More)

We investigate a new method for partitioning a graph into two equal-sized pieces with few connecting edges. We combine ideas from two recently suggested partitioning algorithms, spectral bisectionâ€¦ (More)