Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation (Q6154935): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q128541178, #quickstatements; #temporary_batch_1724714016629
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Communication lower bounds and optimal algorithms for numerical linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: TuckerMPI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite bounds for Hölder-Brascamp-Lieb multilinear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds for distributed-memory matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multilinear Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality related to the isoperimetric inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating alternating least squares for tensor decomposition by pairwise perturbation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Lower Bounds of Bilinear Algorithms for Symmetric Tensor Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Tucker Approximation of a Tensor from Streaming Data / rank
 
Normal rank

Revision as of 09:50, 27 August 2024

scientific article; zbMATH DE number 7805904
Language Label Description Also known as
English
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation
scientific article; zbMATH DE number 7805904

    Statements

    Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 February 2024
    0 references
    communication lower bounds
    0 references
    multi-TTM
    0 references
    tensor computations
    0 references
    parallel algorithms
    0 references
    HBL-inequalities
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references