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ženo v:
Podrobná bibliografie
Vydáno v:Parallel computing Ročník 21; číslo 11; s. 1769 - 1782
Hlavní autoři: Mattor, Nathan, Williams, Timothy J., Hewett, Dennis W.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.11.1995
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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.
Bibliografie: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