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.

Saved in:
Bibliographic Details
Published in:Parallel computing Vol. 21; no. 11; pp. 1769 - 1782
Main Authors: Mattor, Nathan, Williams, Timothy J., Hewett, Dennis W.
Format: Journal Article
Language:English
Published: Elsevier B.V 01.11.1995
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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