A coarse-grained parallel QR-factorization algorithm for sparse least squares problems (Q1274375)
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 1238370
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A coarse-grained parallel QR-factorization algorithm for sparse least squares problems |
scientific article; zbMATH DE number 1238370 |
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
0.8536906242370605
0 references
0.8506126999855042
0 references
0.8451337814331055
0 references
