230 search results - page 29 / 46 » Sparse matrix factorization on massively parallel computers |
125
click to vote
BMCBI
2011
14 years 4 months ago
2011
Background: Automated, image based high-content screening is a fundamental tool for discovery in biological science. Modern robotic fluorescence microscopes are able to capture th...
69
Voted
MOC
2000
14 years 9 months ago
2000
Recently Laurie presented a new algorithm for the computation of (2n+1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a...
COMPUTING
2007
14 years 9 months ago
2007
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
AMC
2010
14 years 9 months ago
2010
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
107
click to vote
SC
2009
ACM
15 years 2 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...