Parallel pivoting combined with parallel reduction and fill-in control
The paper deals with parallel algorithms for LU decomposition of large sparse unsymmetric matrices on multiprocessor systems. A computational model considered is the shared-memory MIMD where the synchronization allows multiple updates. The pivoting strategy is incorporated in the triangularization algorithms whereby the numerical stability can be checked in the parallel process. Actual performance results of the decomposition on the HEP (heterogeneous element processor) are presented.
scientific article; zbMATH DE number 4111893