An Efficient Randomized Hierarchical Tucker Decomposition
From MaRDI portal
Cites work
- A Multilinear Singular Value Decomposition
- A new scheme for the tensor representation
- A new truncation strategy for the higher-order singular value decomposition
- A TT-based hierarchical framework for decomposing high-order tensors
- A two-stage surrogate model for neo-Hookean problems based on adaptive proper orthogonal decomposition and hierarchical tensor approximation
- Advanced Linear and Matrix Algebra
- Approximation in the extended functional tensor train format
- Black box approximation of tensors in hierarchical Tucker format
- Data-driven reduced order modeling based on tensor decompositions and its application to air-wall heat transfer in buildings
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Incremental Hierarchical Tucker Decomposition
- Julia: a fresh approach to numerical computing
- Low-rank tensor methods for partial differential equations
- Multilinear Algebra
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Randomized algorithms for streaming low-rank approximation in tree tensor network format
- Recompression of Hadamard Products of Tensors in Tucker Format
- Solving high-dimensional parabolic PDEs using the tensor train format
- Some mathematical notes on three-mode factor analysis
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- The approximation of one matrix by another of lower rank.
This page was built for publication: An Efficient Randomized Hierarchical Tucker Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409313)