Implementing Sparse Matrix Ordering Using Hypergraph Partitioning
2013 ◽
Vol 706-708
◽
pp. 1890-1893
Keyword(s):
Matrix ordering is a key technique when applying Cholesky factorization method to solving sparse symmetric positive definite system Ax = b. Much effort has been devoted to the development of powerful heuristic ordering algorithms. This paper implements a sparse matrix ordering scheme based on hypergraph partitioning. The novel nested dissection ordering scheme achieve the vertex separator by hypergraph partitioning. Experimental results show that the novel scheme produces results that are substantially better than METIS.
2000 ◽
Vol 12
(2-3)
◽
pp. 69-84
◽
Keyword(s):
2016 ◽
Vol 32
(2)
◽
pp. 274-289
◽
1998 ◽
Vol 10
(1)
◽
pp. 107-113
◽
Keyword(s):
1998 ◽
Vol 48
(1)
◽
pp. 71-95
◽
1998 ◽
Vol 19
(3)
◽
pp. 682-695
◽
Keyword(s):
2013 ◽
Vol 3
(4)
◽
pp. 1097-1111
◽
1997 ◽
Vol 41
(1.2)
◽
pp. 171-183
◽