| |
|
Item: REP-2008-449
|
| |
Item:REP-2008-449
|
Title:Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization
Laura Grigori
INRIA
Saclay - Ile de France, Laboratoire de Recherche en Informatique Universite Paris-Sud 11, France
Erik Boman
Scalable Algorithms Dept., Sandia National Laboratories
Sandia National Laboratories, NM 87185-1318, USA
Simplice Donfack
Universite de Yaounde I, Computer Science Department
B.P 812 Yaounde - Cameroun
Timothy A. Davis
CISE Dept, Univ. of Florida
E301 CSE, PO Box 116120, Univ. of Florida, Gainesvile FL, 32611
Abstract:
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 important properties. It takes a global perspective of the entire matrix, as opposed to local heuristics. It takes into account the assymetry of the input matrix by using a hypergraph to represent its structure. It is suitable for performing Gaussian elimination in parallel, with partial pivoting. This is possible because the row permutations performed due to partial pivoting do not destroy the column separators identified by the nested dissection approach. Experimental results on 27 medium and large size highly unsymmetric matrices compare HUND to four other well-known reordering algorithms. The results show that HUND provides a robust reordering algorithm, in the sense that it is the best or close to the best (often within 10%) of all the other methods.
Additional Information: here
|
|
| |
|
Select Departmental Reports
|
| |
|
|
| |
|
Departmental Report Categories
|
| |
|
|
To submit items for this page, please log in on the
CISE submit page.
|
|