Parallel algorithms for QR decomposition on a shared memory multiprocessor (Q811081)
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 4215249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for QR decomposition on a shared memory multiprocessor |
scientific article; zbMATH DE number 4215249 |
Statements
Parallel algorithms for QR decomposition on a shared memory multiprocessor (English)
0 references
1991
0 references
Empirical investigation of 2 Givens and 3 Householder type algorithms and different versions of them in Pascal (why not Fortran?) on 2 Encore Multimax shared memory parallel computers with 8 and 10 processors. One of the Householder algorithms proves to be superior. But one should be careful in generalizing the result because other memory access, compiler and synchronization primitives may change the conclusion.
0 references
parallel algorithms
0 references
QR decomposition
0 references
shared memory multiprocessor
0 references
algorithm comparison
0 references
Givens rotations
0 references
Householder algorithms
0 references
0.869692325592041
0 references
0.858130693435669
0 references
0.847493588924408
0 references
0.8470754623413086
0 references
