Parallel strategies for rank-\(k\) updating of the QR decomposition (Q2706284)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel strategies for rank-\(k\) updating of the QR decomposition |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel strategies for rank-\(k\) updating of the QR decomposition |
scientific article |
Statements
19 March 2001
0 references
QR decomposition
0 references
Givens rotations
0 references
parallel algorithms
0 references
matrix factorization
0 references
orthogonalization
0 references
Parallel strategies for rank-\(k\) updating of the QR decomposition (English)
0 references
The paper deals with parallel strategies based on Givens rotations for updating the QR decomposition of an \(n\times n\) matrix after a rank-\(k\) change \((k<n)\).
0 references
