A cost-optimal parallel tridiagonal system solver (Q918628)
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 cost-optimal parallel tridiagonal system solver |
scientific article; zbMATH DE number 4159957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cost-optimal parallel tridiagonal system solver |
scientific article; zbMATH DE number 4159957 |
Statements
A cost-optimal parallel tridiagonal system solver (English)
0 references
1990
0 references
The solution of a tridiagonal system is transformed into three recurrence equations. These recurrence equations are solved simply doing continued fraction expansions and applying the substitution concept. It is cost- optimal in the sense that processor number times execution time is minimized.
0 references
parallel computation
0 references
tridiagonal system
0 references
recurrence equations
0 references
continued fraction expansions
0 references
0.9440769
0 references
0.9411751
0 references
0.9393827
0 references
0.93071383
0 references
0.9296373
0 references
0.9285327
0 references
