A study of the performance of Neville elimination using two kinds of partitioning techniques

In this paper, a method to compute the solution of a system of linear equat ions by means of Neville elimination is described using two kinds of partit ioning techniques: Block and Block-striped. This type of approach is especi ally suited to the case of totally positive linear systems, which is presen t in different fields of application. Although Neville elimination carried out more floating point operations than Gaussian elimination in some cases, in this study we confirm that these advantages disappear when we use multi processor systems. On the other hand, the overall parallel run time of Nevi lle elimination is batter than Gauss time as Neville elimination uses a low er cost communication model. (C) 2001 Elsevier Science Inc. All rights rese rved.