A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Space and time efficient implementations of parallel nested dissection

1992
*
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures - SPAA '92
*

Nested dissection (ND) is a method for solving sparse n × n linear systems efficiently by imposing an order of elimination on the variables. Parallel nested dissection (PND) algorithms, which perform this variable elimination in parallel, have been developed for the PRAM model and for grid architectures. In this paper, we describe the following improvements to the known PND algorithms: 1. FAST PND: a fast PND algorithm for the PRAM model, which reduces the time bound by a factor of O(log n),

doi:10.1145/140901.141912
dblp:conf/spaa/ArmonR92
fatcat:gmjpqsdiyvgmdoq24zy7eaqdpi