Parallel Randomized Tucker Decomposition Algorithms
Authors:
- 2 April 2024
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (2) , A1186-A1213
Abstract
The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. We propose to accelerate Tucker tensor decomposition algorithms by using...Keywords
All Related Versions
Funding Information
- National Science Foundation (CCF-1942892)
This publication has 31 references indexed in Scilit:
- An Efficient Randomized Algorithm for Computing the Approximate Tucker DecompositionJournal of Scientific Computing, 2021
- Faster Johnson–Lindenstrauss transforms via Kronecker productsInformation and Inference: A Journal of the IMA, 2020
- Randomized CP tensor decompositionMachine Learning: Science and Technology, 2020
- Computing Dense Tensor Decompositions with Optimal Dimension TreesAlgorithmica, 2018
- Randomized algorithms for the approximations of Tucker and the tensor train decompositionsAdvances in Computational Mathematics, 2018
- Velocity and Reactive Scalar Dissipation Spectra in Turbulent Premixed FlamesCombustion Science and Technology, 2016
- Matrix Analysis2012
- A fast randomized algorithm for the approximation of matricesApplied and Computational Harmonic Analysis, 2008
- Collective communication: theory, practice, and experienceConcurrency and Computation: Practice and Experience, 2007
- Reynolds number effects on Rayleigh–Taylor instability with possible implications for type Ia supernovaeNature Physics, 2006