Sciweavers

2 search results - page 1 / 1
» Hypergraph-Based Unsymmetric Nested Dissection Ordering for ...
Sort
View
SIAMSC
2010
142views more  SIAMSC 2010»
15 years 1 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
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...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
142
Voted
NAA
2000
Springer
97views Mathematics» more  NAA 2000»
15 years 10 months ago
Nested-Dissection Orderings for Sparse LU with Partial Pivoting
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
Igor Brainman, Sivan Toledo