Sciweavers

230 search results - page 1 / 46
» Sparse matrix factorization on massively parallel computers
Sort
View
SC
2009
ACM
13 years 11 months ago
Sparse matrix factorization on massively parallel computers
Anshul Gupta, Seid Koric, Thomas George
IPPS
2000
IEEE
13 years 9 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen
EUROPAR
2003
Springer
13 years 10 months ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro
PC
2010
100views Management» more  PC 2010»
12 years 11 months ago
Analysis of the solution phase of a parallel multifrontal approach
We study the forward and backward substitution phases of a sparse multifrontal factorization. These phases are often neglected in papers on sparse direct factorization but, in man...
Patrick Amestoy, Iain S. Duff, Abdou Guermouche, T...
ALGORITHMICA
1999
123views more  ALGORITHMICA 1999»
13 years 4 months ago
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
Erich Kaltofen, A. Lobo