• Publications
  • Influence
Nested Dissection of a Regular Finite Element Mesh
Let M be a mesh consisting of $n^2 $ squares called elements, formed by subdividing the unit square $(0,1) \times (0,1)$ into $n^2 $ small squares of side ${1 / h}$, and having a node at each of theExpand
  • 1,015
  • 60
The Evolution of the Minimum Degree Ordering Algorithm
TLDR
Over the past fifteen years, the implementation of the minimum degree algorithm has received much study, and many important enhancements have been made to it. Expand
  • 426
  • 18
  • PDF
Solution of sparse linear least squares problems using givens rotations
Abstract We describe a direct method for solving sparse linear least squares problems. The storage required for the method is no more than that needed for the conventional normal equations approach.Expand
  • 183
  • 11
An Implementation of a Pseudoperipheral Node Finder
TLDR
We provide a well-structured flexible implementat ion of this algori thm which includes some .modifications tha t appear to improve its performance. Expand
  • 79
  • 8
Computer Solution of Large Sparse Positive Definite
  • 395
  • 7
AN ANALYSIS OF SPECTRAL ENVELOPE-REDUCTION VIA QUADRATIC ASSIGNMENT PROBLEMS
A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described in [Barnard, Pothen, and Simon, Numer. Linear Algebra Appl., 2 (1995), pp. 317--334]. TheExpand
  • 52
  • 7
  • PDF
Communication results for parallel sparse Cholesky factorization on a hypercube
TLDR
We consider the problem of reducing data traffic among processor nodes during the parallel factorization of a sparse matrix on a hypercube multiprocessor. Expand
  • 121
  • 6
Solution of sparse positive definite systems on a hypercube
The solution of large sparse positive definite systems of equations typically involves four steps: ordering, data structure set-up (symbolic factorization), numerical factorization, and triangularExpand
  • 62
  • 6
Sparse Cholesky factorization on a local-memory multiprocessor
TLDR
This article deals with the problem of factoring a large sparse positive definite matrix on a multiprocessor system based on a binary hypercube topology. Expand
  • 138
  • 5
...
1
2
3
4
5
...