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. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Alonso, P., Cortina, R., & Ranilla, J. (1999). Block-striped partitioning and neville elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1685 LNCS, pp. 1073–1077). Springer Verlag. https://doi.org/10.1007/3-540-48311-x_150
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
