Parallel Neville elimination: A simple cost-optimal algorithm

Author

Alonso, P. ; Cortina, R. ; Díaz, I. ; Ranilla, J. ; Hernandez, V.

Author_Institution

Dept. de Matematicas, Oviedo Univ., Spain

fYear

2001

fDate

2001

Firstpage

182

Lastpage

186

Abstract

In this paper a parallel algorithm to solve linear equation systems is presented. This method, known as Neville elimination, is appropriate especially for the case of a totally positive matrix (all its minors are nonnegative). We prove that this algorithm is cost-optimal for a given parallel implementation of Neville elimination, in which the coefficient matrix is rowwise stripe-partitioned among the processors. In case of Gaussian elimination it is necessary a pipelined version to obtain the optimal cost. Furthermore, experimental results obtained on an IBM SP2 multicomputer using MPI corroborate the theoretic estimation about the algorithm efficiency

Keywords

interpolation; matrix algebra; parallel algorithms; Gaussian elimination; IBM SP2 multicomputer; coefficient matrix; cost-optimal algorithm; linear equation systems; parallel Neville elimination; parallel algorithm; rowwise stripe-partitioned; totally positive matrix; Application software; Computational efficiency; Cost function; Equations; Estimation theory; Interpolation; Linear systems; Mathematics; Parallel algorithms; Statistics;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Workshops, 2001. International Conference on

Conference_Location

Valencia

ISSN

1530-2016

Print_ISBN

0-7695-1260-7

Type

conf

DOI

10.1109/ICPPW.2001.951934

Filename

951934