#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1992

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Deganit Armon, John H. Reif
- WADS
- 1993

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)

- Deganit Armon, John H. Reif
- SPAA
- 1992

Nested dissection is a method for solving large sparse systems of linear equations. The method is inherently parallelizable and efficient algorithms for parallel nested dissection (PND) exist for various parallel architectures. Birkhoff and George showed that for a sparse grid graph, a parallel algorithm with n processors takes O(@ parallel time [1]. The… (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
- ›