Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous
โฆ LIBER โฆ
QR factorization of a dense matrix on a shared-memory multiprocessor
โ Scribed by Eleanor Chu; Alan George
- Book ID
- 107919234
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 897 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Parallel algorithms for QR decomposition
โ
K. Wright
๐
Article
๐
1991
๐
Elsevier Science
๐
English
โ 733 KB
Parallel sparse Cholesky factorization o
โ
G Zhang; H.C Elman
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 766 KB
Dynamic programming on a shared-memory m
โ
Phil Edmonds; Eleanor Chu; Alan George
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 677 KB
Macromolecular dynamics on a shared-memo
โ
Robert D. Skeel
๐
Article
๐
1991
๐
John Wiley and Sons
๐
English
โ 498 KB
This is a study of the effect of data structures and algorithms on parallelism and vectorization for the molecular dynamics package GROMOS. About 80% of the computing time (for the GROMOS benchmark) is spent on the nonbonded interactions, and an important issue is the method that is used for finding
Symbolic Cholesky factorization on a loc
โ
Alan George; Micheal T Heath; Esmond Ng; Joseph Liu
๐
Article
๐
1987
๐
Elsevier Science
๐
English
โ 755 KB
Supernodal symbolic Cholesky factorizati
โ
Esmond Ng
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 547 KB