Deganit Armon

  • Citations Per Year
Learn More
Our work is based on the pioneering work in sphere separators done by Miller, Teng, Vavasis et al, [8, 12], who gave efficient static (fixed input) algorithms for finding sphere separators of size s(n) = O(n d−1 d ) for a set of points in R. We present dynamic algorithms which maintain separators for a dynamically changing graph. Our algorithms answer(More)
This paper is concerned with algorithms for the efficient parallel solution of sparse, symmetric n × n linear systems via direct factorization, which eliminate groups of variables in stages. The algorithms make use of nested dissection to recursively cut data into pieces, producing orderings for direct elimination of the variables, so to reduce the storage(More)
  • 1