𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the accuracy of the parallel diagonal dominant algorithm

✍ Scribed by Hong Zhang

Book ID
104304375
Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
294 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

Zhang, H. On the accuracy of the Parallel Diagonal Dominant Algorithm, Parallel Computing 17 (1991)

265-272

The Parallel Diagonal Dominant (PDD) Algorithm has been proposed for solving certain types of tridiagonal linear systems. The algorithm uses a matrix approximation. Both theoretical and experimental results have shown that the PDD algorithm is a highly efficient parallel algorithm for a variety of architectures. In this paper, the effect of this approximation is studied and discussed. The numerical results are presented.

πŸ“œ SIMILAR VOLUMES

Parallel algorithms for the domination p
Parallel algorithms for the domination problems in trapezoid graphs
✍ Y.Daniel Liang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR