A coarse-grained parallel QR-factorization algorithm for sparse least squares problems (Q1274375): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:04, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A coarse-grained parallel QR-factorization algorithm for sparse least squares problems |
scientific article |
Statements
A coarse-grained parallel QR-factorization algorithm for sparse least squares problems (English)
0 references
12 January 1999
0 references
coarse-grained parallelism
0 references
least squares problem
0 references
QR-factorization
0 references
general sparse matrix
0 references
drop-tolerance
0 references
reordering
0 references
partitioning
0 references
block algorithm
0 references
