Algorithm for solving tridiagonal matrix problems in parallel

A new algorithm is presented, designed to solve tridiagonal matrix problems efficiently with parallel computers (multiple instruction stream, multiple data stream (MIMD) machines with distributed memory). The algorithm is designed to be extendable to higher order banded diagonal systems.

Uložené v:
Podrobná bibliografia
Vydané v:Parallel computing Ročník 21; číslo 11; s. 1769 - 1782
Hlavní autori: Mattor, Nathan, Williams, Timothy J., Hewett, Dennis W.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.11.1995
Predmet:
Banded diagonal matrix
Distributed memory multiprocessor
Interprocessor communication
Linear algebra
Tridiagonal systems
Banded diagonal matrix
Distributed memory multiprocessor
Interprocessor communication
Tridiagonal systems
Linear algebra
ISSN:0167-8191, 1872-7336
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A new algorithm is presented, designed to solve tridiagonal matrix problems efficiently with parallel computers (multiple instruction stream, multiple data stream (MIMD) machines with distributed memory). The algorithm is designed to be extendable to higher order banded diagonal systems.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0167-8191
1872-7336
DOI:10.1016/0167-8191(95)00033-0