Parallel algorithms for sparse triangular system solution (Q1208515)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 166532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for sparse triangular system solution |
scientific article; zbMATH DE number 166532 |
Statements
Parallel algorithms for sparse triangular system solution (English)
0 references
16 May 1993
0 references
The elimination tree is used to enhance the forward and backward substitutions for the Cholesky factorization. The authors generalize the technique of \textit{G. Li} and \textit{T. F. Coleman} [SIAM J. Sci. Stat. Comput. 9, No. 3, 485-502 (1988; Zbl 0644.65020)] to sparse matrices. First graph theoretic results associated with the elemination tree are given. This is followed by the new parallel algorithms. The paper concludes with implementation details and computation results on PARAM, a multi-transputer local memory multiprocessor system using 4, 8 and 16 processors. These results indicate a significant enhancement in the overall performance.
0 references
sparse triangular system
0 references
elimination tree
0 references
Cholesky factorization
0 references
sparse matrices
0 references
parallel algorithms
0 references
computation results
0 references
PARAM
0 references
multi- transputer local memory multiprocessor system
0 references
performance
0 references
0.8609437942504883
0 references
