Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization (Q4891737): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: LAPACK / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2119233169 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:21, 20 March 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
