16 search results - page 2 / 4 » Updating an LU Factorization with Pivoting |
NAA
2000
Springer
13 years 9 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 15 days 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...
SPAA
1998
ACM
13 years 10 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
MOC
1998
13 years 5 months ago
1998
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
AAECC
2007
Springer
13 years 5 months ago
2007
Springer
We present a simulation-based performance model to analyze a parallel sparse LU factorization algorithm on modern cached-based, high-end parallel architectures. We consider supern...