On the accuracy of the parallel diagonal dominant algorithm (Q811082)
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 accuracy of the parallel diagonal dominant algorithm |
scientific article; zbMATH DE number 4215252
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the accuracy of the parallel diagonal dominant algorithm |
scientific article; zbMATH DE number 4215252 |
Statements
On the accuracy of the parallel diagonal dominant algorithm (English)
0 references
1991
0 references
The parallel diagonal dominant (PDD) algorithm is considered for solving a tridiagonal linear system of equations. It is shown that the PDD algorithm is a highly efficient parallel algorithm for a variety of architectures. The author studies the accuracy of the results of the PDD algorithm. Furthermore, he also discusses the effect of the matrix modification along with a rigorous error analysis.
0 references
parallel diagonal dominant algorithm
0 references
tridiagonal linear system
0 references
matrix modification
0 references
error analysis
0 references
0.9770102
0 references
0.8802363
0 references
0.8722675
0 references
0 references
0 references
0.8611734
0 references
0.8575408
0 references
