Results

**1 - 1**of**1**### Parallel Pivots LU Algorithm on the Cray T3E

, 1999

"... . Solving large nonsymmetric sparse linear systems on distributed memory multiprocessors is an active research area. We present a loop-level parallelized generic algorithm which comprises analyse-factorize and solve stages. To further exploit matrix sparsity and parallelism, the analyse step looks f ..."

Abstract
- Add to MetaCart

(Show Context)
. Solving large nonsymmetric sparse linear systems on distributed memory multiprocessors is an active research area. We present a loop-level parallelized generic algorithm which comprises analyse-factorize and solve stages. To further exploit matrix sparsity and parallelism, the analyse step looks for a set of compatible pivots. Sparse techniques are applied until the reduced submatrix reaches a threshold density. At this point, a switch to dense routines takes place in both analyse-factorize and solve stages. The SPMD code follows a sparse cyclic distribution to map the system matrix onto a P \Theta Q processor mesh. Experimental results show a good behavior of our sequential algorithm compared with a standard generic solver: the MA48 routine. Additionally, a parallel version on the Cray T3E exhibits high performance in terms of speed-up and efficiency. 1 Introduction The kernel of many computer-assisted scientific applications is to solve large sparse linear systems. We find example...