Parallel QR decomposition of a rectangular matrix (Q1074297)
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 QR decomposition of a rectangular matrix |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel QR decomposition of a rectangular matrix |
scientific article |
Statements
Parallel QR decomposition of a rectangular matrix (English)
0 references
1986
0 references
An algorithm for the QR-decomposition of rectangular matrices is proved to be optimal on the class of all parallel algorithms using Givens rotations. The algorithm is based on greedy standard parallel Givens sequences. The complexity of this algorithm is estimated.
0 references
QR-decomposition
0 references
rectangular matrices
0 references
parallel algorithms
0 references
Givens rotations
0 references
complexity
0 references
