An optimal algorithm for Gaussian elimination of band matrices on an MIMD computer (Q918627)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An optimal algorithm for Gaussian elimination of band matrices on an MIMD computer |
scientific article; zbMATH DE number 4159956
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for Gaussian elimination of band matrices on an MIMD computer |
scientific article; zbMATH DE number 4159956 |
Statements
An optimal algorithm for Gaussian elimination of band matrices on an MIMD computer (English)
0 references
1990
0 references
This paper presents the LU decomposition of band matrices by the Gaussian elimination method with partial pivoting on an MIMD conputer. An optimal number of processors in the system is determined according to the numbers of diagonals in the matrix. A task scheduling procedure is also given. An excellent load balancing is obtained. Communication and synchronization in the system is performed using the message-passing technique.
0 references
parallel solver
0 references
LU decomposition
0 references
band matrices
0 references
Gaussian elimination method
0 references
partial pivoting
0 references
MIMD conputer
0 references
task scheduling procedure
0 references
Communication
0 references
synchronization
0 references
message-passing technique
0 references
0.8608806133270264
0 references
0.846455991268158
0 references
0.8316411972045898
0 references
0.8116130828857422
0 references