8 search results - page 1 / 2 » Nested-Dissection Orderings for Sparse LU with Partial Pivot... |
NAA
2000
Springer
13 years 11 months ago
2000
Springer
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...
SIAMSC
2010
13 years 2 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...
ICS
2005
Tsinghua U.
14 years 1 months ago
2005
Tsinghua U.
Several message passing-based parallel solvers have been developed for general (non-symmetric) sparse LU factorization with partial pivoting. Due to the fine-grain synchronizatio...
TPDS
1998
13 years 7 months ago
1998
TOMS
2011
13 years 2 months ago
2011
We present a new supernode-based incomplete LU factorization method to construct a preconditioner for solving sparse linear systems with iterative methods. The new algorithm is pr...