Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization (Q4891737): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LAPACK / rank | |||
Normal rank | |||
Revision as of 23:19, 29 February 2024
scientific article; zbMATH DE number 926305
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
