On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization (Q1179035)
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: On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization |
scientific article; zbMATH DE number 23781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization |
scientific article; zbMATH DE number 23781 |
Statements
On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization (English)
0 references
26 June 1992
0 references
Two methods are presented to solve tridiagonal systems on parallel and vector computers. The first algorithm for diagonally dominant systems uses incomplete Gaussian elimination without pivoting. The other one applies Gaussian elimination with partial pivoting for more general systems. Both methods are based on wrap-around partitioning. The author carefully studies the speedup and provides an example on a CRAY X-MP.
0 references
parallel computer
0 references
tridiagonal systems
0 references
vector computers
0 references
algorithm
0 references
diagonally dominant systems
0 references
incomplete Gaussian elimination without pivoting
0 references
partial pivoting
0 references
wrap-around partitioning
0 references
CRAY X-MP
0 references
0 references
0 references
0 references
