Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures (Q5883714): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113309846, #quickstatements; #temporary_batch_1705915684099 |
Changed an Item |
||
| Property / cites work | |||
| Property / cites work: POOCLAPACK / rank | |||
Normal rank | |||
Revision as of 18:43, 16 February 2024
scientific article; zbMATH DE number 7666978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures |
scientific article; zbMATH DE number 7666978 |
Statements
Algorithm 1022: Efficient Algorithms for Computing a Rank-Revealing UTV Factorization on Parallel Computing Architectures (English)
0 references
22 March 2023
0 references
numerical linear algebra
0 references
rank-revealing matrix factorization
0 references
singular value decomposition
0 references
high performance
0 references
randomized methods
0 references
block algorithm
0 references
algorithm-by-blocks
0 references
randomized SVD
0 references
