Randomized algorithms for the low-rank approximation of matrices (Q3010073): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q36299805, #quickstatements; #temporary_batch_1719315614938
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On interpolation and integration in finite-dimensional spaces of bounded functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compression of Low Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete cross approximation in the mosaic-skeleton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of the DFT with only a subset of input or output points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating Extremal Eigenvalues and Condition Numbers of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start / rank
 
Normal rank

Latest revision as of 05:38, 4 July 2024

scientific article
Language Label Description Also known as
English
Randomized algorithms for the low-rank approximation of matrices
scientific article

    Statements

    Identifiers