A fast vector algorithm for solving tridiagonal linear equations (Q1118354)
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: A fast vector algorithm for solving tridiagonal linear equations |
scientific article; zbMATH DE number 4094672
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast vector algorithm for solving tridiagonal linear equations |
scientific article; zbMATH DE number 4094672 |
Statements
A fast vector algorithm for solving tridiagonal linear equations (English)
0 references
1989
0 references
Incomplete cyclic reduction is applied to tridiagonal systems to split them into a number of small independent systems which can be solved in parallel. The authors report on experiments in which, belong others, the optimum dimension of the small systems was found to be about one half of the characteristic number \(n_{1/2}\) of the vector computer (50 for the CYBER 205 and 20 for the CRAY X-MP/24).
0 references
Gauss elimination
0 references
numerical examples
0 references
parallel computation
0 references
Incomplete cyclic reduction
0 references
tridiagonal systems
0 references
vector computer
0 references
