Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations (Q1179243)
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: Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations |
scientific article; zbMATH DE number 24145
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations |
scientific article; zbMATH DE number 24145 |
Statements
Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations (English)
0 references
26 June 1992
0 references
A divide and conquer algorithm for solving general linear tridiagonal systems of equations with one right-hand side is described. The algorithm is suited for parallel computers (MIMD-systems), and permits multiprocessing or a combination of vector and multiprocessor implementations. CPU-time measurements on a CRAY X-MP/28, on an Alliant FX/8, and on a Sequent Symmetry S81b are presented and discussed. Furthermore, the CPU- times of the proposed algorithm is compared with those of the cyclic reduction and Gaussian elimination.
0 references
parallel algorithms
0 references
comparison of methods
0 references
timing results
0 references
divide and conquer algorithm
0 references
linear tridiagonal systems
0 references
CRAY X-MP/28
0 references
Alliant FX/8
0 references
Sequent Symmetry S81b
0 references
CPU-times
0 references
cyclic reduction
0 references
Gaussian elimination
0 references
0.9321472
0 references
0.92943496
0 references
0.9290657
0 references
