Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization (Q4891737)
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 926305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization |
scientific article; zbMATH DE number 926305 |
Statements
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization (English)
0 references
25 March 1997
0 references
singular value decomposition
0 references
rank-revealing factorization
0 references
least squares computations
0 references
linear dependency analysis
0 references
subspace tracking
0 references
rank determination
0 references
nonsymmetric eigenproblems
0 references
condition estimation
0 references
QR factorization
0 references
numerical rank
0 references
algorithms
0 references
0.896753191947937
0 references
0.896753191947937
0 references
0.8812660574913025
0 references
0.8812660574913025
0 references
0.8632352352142334
0 references
