230 search results - page 21 / 46 » Sparse matrix factorization on massively parallel computers |
101
click to vote
EUROPAR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
113
click to vote
BMCBI
2010
14 years 4 months ago
2010
Background: Nonparametric Bayesian techniques have been developed recently to extend the sophistication of factor models, allowing one to infer the number of appropriate factors f...
101
Voted
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
WCE
2007
14 years 10 months ago
2007
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...