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 equations by means of Neville elimination is described using two kinds of partitioning techniques: Block and Block-striped. This type of approach is especially suited to the case of totally positive linear systems, which is present 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 multiprocessor systems. On the other hand, the overall parallel run time of Neville elimination is better than Gauss time as Neville elimination uses a lower cost communication model.