Recompression of Hadamard Products of Tensors in Tucker Format
From MaRDI portal
Publication:5357970
DOI10.1137/16M1093896zbMath1373.65031MaRDI QIDQ5357970
Publication date: 18 September 2017
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Lanczos methodHadamard productiterative methodsdata analysisrandomized algorithmscomplexity reductionTucker formattensor-based algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
TensorToolbox.jl ⋮ An efficient algorithm for computing the approximate t-URV and its applications ⋮ Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations ⋮ hm-toolbox: MATLAB Software for HODLR and HSS Matrices ⋮ A low-rank isogeometric solver based on Tucker tensors ⋮ An optimization approach for dynamical Tucker tensor approximation ⋮ On the convergence of Krylov methods with low-rank truncations ⋮ Norm and Trace Estimation with Random Rank-one Vectors ⋮ Projection methods for dynamical low-rank approximation of high-dimensional problems ⋮ Iterative algorithms for the post-processing of high-dimensional data ⋮ Functional Tucker Approximation Using Chebyshev Interpolation ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format ⋮ Parallel Algorithms for Tensor Train Arithmetic
Uses Software
Cites Work
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Tucker factorization with missing data with application to low-\(n\)-rank tensor completion
- Dynamical low-rank approximation: Applications and numerical experiments
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- A new scheme for the tensor representation
- Tensor train approximation of moment equations for elliptic equations with lognormal coefficient
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
- Jacobi Algorithm for the Best Low Multilinear Rank Approximation of Symmetric Tensors
- Block Tensor Unfoldings
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Julia: A Fresh Approach to Numerical Computing
- Matrices with Hierarchical Low-Rank Structures
- Dynamical Tensor Approximation
- Tensor Spaces and Numerical Tensor Calculus
- Polynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format
- A Multilinear Singular Value Decomposition
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- Algorithm 941
- Fast Multidimensional Convolution in Low-Rank Tensor Formats via Cross Approximation
- Chebfun in Three Dimensions
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
This page was built for publication: Recompression of Hadamard Products of Tensors in Tucker Format
