• Publications
  • Influence
PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS*
TLDR
The problem ofcomputing a small vertex separator in a graph arises in the context of the parallel factorization of sparse, symmetric matrices. Expand
  • 1,747
  • 42
  • PDF
A spectral algorithm for envelope reduction of sparse matrices
TLDR
An algorithm for reducing the envelope of a sparse matrix is presented. Expand
  • 154
  • 20
  • PDF
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
TLDR
Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Expand
  • 238
  • 18
  • PDF
Two improved algorithms for envelope and wavefront reduction
Two algorithms for reordering sparse, symmetric matrices or undirected graphs to reduce envelope and wavefront are considered. The first is a combinatorial algorithm introduced by Sloan and furtherExpand
  • 90
  • 16
  • PDF
Computing the block triangular form of a sparse matrix
TLDR
We consider the problem of permuting the rows and columns of a rectangular or square, unsymmetric sparse matrix to compute its block triangular form and provide computational results on sparse matrices from test collections. Expand
  • 333
  • 14
  • PDF
A Scalable Parallel Algorithm for Incomplete Factor Preconditioning
TLDR
We describe a parallel algorithm for computing incomplete factor (ILU) preconditioners. Expand
  • 130
  • 11
  • PDF
Graph coloring algorithms for multi-core and massively multithreaded architectures
TLDR
We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1 graph coloring. Expand
  • 63
  • 11
  • PDF
ColPack: Software for graph coloring and related problems in scientific computing
TLDR
We present a suite of fast and effective algorithms, encapsulated in a software package called ColPack, for a variety of graph coloring and related problems. Expand
  • 85
  • 11
  • PDF
Protocols for disease classification from mass spectrometry data
We report our results in classifying protein matrix‐assisted laser desorption/ionization‐time of flight mass spectra obtained from serum samples into diseased and healthy groups. We discuss in detailExpand
  • 131
  • 10
  • PDF
A Mapping Algorithm for Parallel Sparse Cholesky Factorization
TLDR
A task-to-processor mapping algorithm is described for computing the parallel multifrontal Cholesky factorization of irregular sparse problems on distributed-memory multiprocessors. Expand
  • 81
  • 9