A direct parallel sparse matrix solver

The direct sparse matrix solver is based on a domain decomposition technique to achieve data and work parallelization. Geometries that have long and thin structures are specially efficiently tractable with this solver, provided that they can be decomposed mainly in one direction. Due to the separation of the algorithm into a factorization stage and a solution stage, time-dependent problems with a constant coefficient matrix are particularly well suited for this solver. The parallelization performances obtained on a Gray T3D show that the method scales up to at least 256 processors.


Published in:
Computer Physics Communications, 96, 2-3, 118-128
Year:
1996
ISSN:
0010-4655
Laboratories:
SPC
CRPP




 Record created 2008-04-16, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)