Block-Striped Partitioning and Neville Elimination

Authors:
Pedro Alonso;Raquel Cortina;José Ranilla
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 5
Cited 1

Parallel algorithms for dense linear algebra computations

SIAM Review
Average-case stability of Gaussian elimination

SIAM Journal on Matrix Analysis and Applications
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Total positivity, QR factorization, and Neville elimination

SIAM Journal on Matrix Analysis and Applications
Backward error analysis of Neville elimination

Applied Numerical Mathematics

A Columnwise Block Striping in Neville Elimination

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a message-passing parallel implementation of the solution of linear systems by means of the Neville elimination is described. This type of approach is especially suited to the case of totally positive linear systems, which appears in different application fields. Standard data partitioning techniques, such as block row and block column schemes, are considered on three different topologies: ring, mesh and hypercube. The theoretical performance of the proposed parallel algorithms, in terms of run time, speed-up and efficiency, is derived. Experimental results obtained on an IBM SP2 multicomputer confirm the high performance of the block row parallel algorithm.