230 search results - page 8 / 46 » Sparse matrix factorization on massively parallel computers |
SIAMSC
2010
14 years 4 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...
87
Voted
ICPPW
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper we discuss the parallel implementation of the Cholesky factorization of a positive definite symmetric matrix when that matrix is block tridiagonal. While parallel im...
HPCN
1997
Springer
15 years 1 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
ICS
2005
Tsinghua U.
15 years 3 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...
107
click to vote
PPOPP
1991
ACM
15 years 1 months ago
1991
ACM
This paper presents Jade, a language which allows a programmer to easily express dynamic coarse-grain parallelism. Starting with a sequential program, a programmer augments those ...