An hybrid parallel algorithm for solving tridiagonal linear systems versus the Wang’s method in a Cray T3D BSP computer
| Contribuinte(s) |
Universidad de Alicante. Departamento de Estadística e Investigación Operativa Universidad de Alicante. Departamento de Ciencia de la Computación e Inteligencia Artificial Criptología y Seguridad Computacional |
|---|---|
| Data(s) |
23/11/2012
23/11/2012
2000
|
| Resumo |
In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides. This work was partially supported by Spanish DGES grants PB97-0334 and PB98-0977. |
| Identificador |
CLIMENT, Joan-Josep; TORTOSA, Leandro; ZAMORA, Antonio. "An hybrid parallel algorithm for solving tridiagonal linear systems versus the Wang’s method in a Cray T3D BSP computer". En: Recent advances in applied and theoretical mathematics / Nikos E. Mastorakis (Ed.). Athens : World Scientific and Engineering Society Press, 2000. ISBN 960-8052-211, pp. 236-242 960-8052-211 |
| Idioma(s) |
eng |
| Publicador |
World Scientific and Engineering Society Press |
| Direitos |
info:eu-repo/semantics/openAccess |
| Palavras-Chave | #Tridiagonal linear systems #BSP #Wang’s method #Overlapping Partition (OPM) method #Álgebra #Ciencia de la Computación e Inteligencia Artificial |
| Tipo |
info:eu-repo/semantics/bookPart |
