Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation-Reference-Cited by-同舟云学术

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Published:2024-02-06 Issue:1 Volume:45 Page:450-477
ISSN:0895-4798
Container-title:SIAM Journal on Matrix Analysis and Applications
language:en
Short-container-title:SIAM J. Matrix Anal. Appl.

Author:

Al Daas Hussam¹^ORCID,Ballard Grey²^ORCID,Grigori Laura³^ORCID,Kumar Suraj⁴^ORCID,Rouse Kathryn⁵^ORCID

Affiliation:

1. Science and Technology Facilities Council, Rutherford Appleton Laboratory, Didcot, Oxfordshire, OX11 0QX, UK.

2. Computer Science, Wake Forest University, Winston-Salem, NC 27106 USA.

3. Ecole Polytechnique Fédérale de Lausanne PFL Institute of Mathematics, 1015 Lausanne and Paul Scherrer Institute, Laboratory for Simulation and Modelling, 5232 PSI Villigen, Switzerland; Significant part of the work performed while at Sorbonne Université, Inria, CNRS, Université de Paris, Laboratoire Jacques-Louis Lions, Paris, France.

4. Inria Lyon Centre, France; Significant part of the work performed while at Sorbonne Université, Inria, CNRS, Université de Paris, Laboratoire Jacques-Louis Lions, Paris, France.

5. Inmar Intelligence, Winston-Salem, NC 27101 USA.

Funder

H2020 European Research Council

Division of Computing and Communication Foundations

US Department of Energy, Office of Science, Advanced Scientific Computing Research

Office of Advanced Cyberinfrastructure

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

Analysis

Reference23 articles.

1. Parallel Tensor Compression for Large-Scale Scientific Data

2. Communication lower bounds and optimal algorithms for numerical linear algebra

3. TuckerMPI

4. Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product