416 search results - page 27 / 84 » A Paradigm for Parallel Matrix Algorithms: |
107
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling...
146
click to vote
PPL
2002
15 years 3 months ago
2002
We present new communication-efficient parallel dense linear solvers: a solver for triangular linear systems with multiple right-hand sides and an LU factorization algorithm. Thes...
123
click to vote
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
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...
131
click to vote
HPCN
1997
Springer
15 years 7 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...
158
click to vote
PPSC
1993
15 years 5 months ago
1993
We will present a matrix framework for the conjugate gradient methods, which is expressed in terms of whole vector sequences instead of single vectors or initial parts of sequence...