๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Pivot selection and row ordering in givens reduction on sparse matrices

โœ Scribed by I. S. Duff


Book ID
111706042
Publisher
Springer Vienna
Year
1974
Tongue
English
Weight
514 KB
Volume
13
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On Parallel Selection and Searching in P
โœ R. Sarnath; Xin He ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 246 KB

rithm given by Cole [3] runs in O(log n log\* n) time on an EREW PRAM and in O(log n log\* n/log log n) time on a CRCW PRAM. Both algorithms perform O(n) operations. However, not much work has been done on parallel algorithms for constrained selection. The sequential algorithm in [5] is parallelizab