231 search results - page 2 / 47 » Parallel algorithms for indefinite linear systems |
APIN
2005
13 years 7 months ago
2005
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1
CORR
2007
Springer
13 years 7 months ago
2007
Springer
As multicore systems continue to gain ground in the High Performance Computing world, linear algebra algorithms have to be reformulated or new algorithms have to be developed in or...
KDD
2008
ACM
14 years 7 months ago
2008
ACM
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The goal of this paper is to introduce a new approach to the building of efficient distributed linear system solvers. The starting point of the results of this paper lies in the ...