187 search results - page 1 / 38 » Generic Graph Algorithms for Sparse Matrix Ordering |
ISCOPE
1999
Springer
13 years 9 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
JPDC
1998
13 years 4 months ago
1998
SIAMSC
2010
12 years 11 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
PC
2008
13 years 4 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...