"A Coarse-Grained Parallel QR-Factorization Algorithm for Sparse ..."

Tzvetan Ostromsky, Per Christian Hansen, Zahari Zlatev (1998)

> Home

Details and statistics

DOI: 10.1016/S0167-8191(98)00034-9

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/pc/OstromskyHZ98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pc/OstromskyHZ98
Tzvetan Ostromsky, Per Christian Hansen, Zahari Zlatev:
A Coarse-Grained Parallel QR-Factorization Algorithm for Sparse Least Squares Problems. Parallel Comput. 24(5-6): 937-964 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.