32 search results - page 4 / 7 » Avoiding communication in sparse matrix computations |
ICCSA
2003
Springer
14 years 9 days ago
2003
Springer
The finite difference discretization of the Poisson equation in three dimensions results in a large, sparse, and highly structured system of linear equations. This prototype prob...
SIAMSC
2011
12 years 10 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
GRC
2008
IEEE
13 years 8 months ago
2008
IEEE
An adaptive and iterative LSSVR algorithm based on quadratic Renyi entropy is presented in this paper. LS-SVM loses the sparseness of support vector which is one of the important ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
ICPPW
2009
IEEE
14 years 1 months ago
2009
IEEE
A significant fraction of parallel scientific codes are iterative with barriers between iterations or even between phases of the same iteration. The sender of a message is assur...