A coarse-grained parallel QR-factorization algorithm for sparse least squares problems (Q1274375): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Tzvetan Ostromsky / rank | |||
| Property / author | |||
| Property / author: Per Christian Hansen / rank | |||
| Property / author | |||
| Property / author: Tzvetan Ostromsky / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Per Christian Hansen / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-8191(98)00034-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064079662 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:57, 30 July 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
