Parallel cyclic odd-even reduction algorithms for solving Toeplitz tridiagonal equations on MIMD computers (Q1801375)
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: Parallel cyclic odd-even reduction algorithms for solving Toeplitz tridiagonal equations on MIMD computers |
scientific article; zbMATH DE number 202446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel cyclic odd-even reduction algorithms for solving Toeplitz tridiagonal equations on MIMD computers |
scientific article; zbMATH DE number 202446 |
Statements
Parallel cyclic odd-even reduction algorithms for solving Toeplitz tridiagonal equations on MIMD computers (English)
0 references
10 March 1994
0 references
A performance exposure and exploitation of an MIMD computer complex is carried out. The computational complexity of the cyclic odd-even reduction method is studied. For the cyclic odd-even reduction technique the symmetric constant- diagonal periodic case is chosen as the experimental vehicle, since it is more complicated and its concept indirectly includes that of the corresponding non-periodic case.
0 references
tridiagonal linear system
0 references
performance
0 references
MIMD computer
0 references
computational complexity
0 references
cyclic odd-even reduction method
0 references
0.8330127000808716
0 references
0.8061135411262512
0 references