Randomized LU decomposition using sparse projections (Q2012724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q221660 / rank
Normal rank
 
Property / author
 
Property / author: Amir Z. Averbuch / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962849440 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1601.04280 / 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: On the existence and computation of rank-revealing LU factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong rank revealing LU factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast randomized algorithm for the approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for the decomposition of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative-Error $CUR$ Matrix Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Principal Component Analysis of Large Data Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity lower bounds for dimensionality reducing maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Oblivious Subspace Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Approximation and Regression in Input Sparsity Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser Johnson-Lindenstrauss Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of low-rank matrix approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337625 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:45, 14 July 2024

scientific article
Language Label Description Also known as
English
Randomized LU decomposition using sparse projections
scientific article

    Statements

    Randomized LU decomposition using sparse projections (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2017
    0 references
    LU decomposition
    0 references
    random matrices
    0 references
    sparse matrices
    0 references
    sparse Johnson-Lindenstrauss transform
    0 references

    Identifiers