34 search results - page 3 / 7 » Parallel Computation of the SVD of a Matrix Product |
ICPP
2009
IEEE
14 years 2 months ago
2009
IEEE
The multicore revolution is underway, bringing new chips introducing more complex memory architectures. Classical algorithms must be revisited in order to take the hierarchical me...
ICCS
2005
Springer
14 years 29 days ago
2005
Springer
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
ICPPW
2002
IEEE
14 years 12 days ago
2002
IEEE
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
ICCSA
2003
Springer
14 years 20 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...
HPCN
1997
Springer
13 years 11 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...