Fast Parallel Algorithms for QR and Triangular Factorization (Q3769848)
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: Fast Parallel Algorithms for QR and Triangular Factorization |
scientific article; zbMATH DE number 4028729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast Parallel Algorithms for QR and Triangular Factorization |
scientific article; zbMATH DE number 4028729 |
Statements
Fast Parallel Algorithms for QR and Triangular Factorization (English)
0 references
1987
0 references
triangular factorization
0 references
displacement structure
0 references
Schur algorithm
0 references
Toeplitz matrix
0 references
QR factorization
0 references
Cholesky factorization
0 references
hyperbolic rotations
0 references
Givens rotation
0 references
0.92910385
0 references
0.91276085
0 references
0.91244894
0 references
0.9085752
0 references
0.9072356
0 references
0.9052272
0 references
0.9050935
0 references
0.9008172
0 references
