Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
From MaRDI portal
Publication:5320719
Recommendations
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Low-rank structures and tensor approximations for huge-size data sets
- On optimal low rank Tucker approximation for tensors: the case for an adjustable core size
- Simplicity transformations for three-way arrays with symmetric slices, and applications to Tucker-3 models with sparse core arrays
- Low-rank Tucker approximation of a tensor from streaming data
Cited in
(69)- Tensor decompositions for the bubbles and cube numerical framework
- Chebfun in Three Dimensions
- Cross approximation in tensor electron density computations
- An equi-directional generalization of adaptive cross approximation for higher-order tensors
- Approximate solution of linear systems with Laplace-like operators via cross approximation in the frequency domain
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Generalizing the column-row matrix decomposition to multi-way arrays
- Frequency Extraction for BEM Matrices Arising From the 3D Scalar Helmholtz Equation
- Fast low‐rank approximations of multidimensional integrals in ion‐atomic collisions modelling
- Kronecker product approximation of demagnetizing tensors for micromagnetics
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- ISLET: fast and optimal low-rank tensor regression via importance sketching
- Matrix inversion cases with size-independent tensor rank estimates
- Hybrid CUR-type decomposition of tensors in the Tucker format
- The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
- Grid-based electronic structure calculations: the tensor decomposition approach
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Numerical solution of the Boltzmann equation with S-model collision integral using tensor decompositions
- Tensor decomposition in electronic structure calculations on 3D Cartesian grids
- Linear algebra for tensor problems
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- Generalized cross approximation for 3D-tensors
- Tensor trains approximation estimates in the Chebyshev norm
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Low-rank tensor completion using matrix factorization based on tensor train rank and total variation
- A normal form algorithm for tensor rank decomposition
- Adaptive cross approximation of multivariate functions
- Computation of extreme eigenvalues in higher dimensions using block tensor train format
- A low-rank approach to the computation of path integrals
- Residual-based adaptivity for two-phase flow simulation in porous media using physics-informed neural networks
- Three-value cutting tensors of intuitionistic fuzzy tensors
- Pseudo-skeleton approximations with better accuracy estimates
- Decomposition theorem of intuitionistic fuzzy tensors
- A multilinear Nyström algorithm for low-rank approximation of tensors in Tucker format
- Tensor representation of non-linear models using cross approximations
- Black box low tensor-rank approximation using fiber-crosses
- Fast low-rank solution of the multidimensional hyperbolic problems
- Fast and accurate tensor approximation of a multivariate convolution with linear scaling in dimension
- Separation of variables for function generated high-order tensors
- Wedderburn rank reduction and Krylov subspace method for tensor approximation. I: Tucker case
- Greedy low-rank approximation in Tucker format of solutions of tensor linear systems
- Fast multidimensional convolution in low-rank tensor formats via cross approximation
- Randomized algorithms for the low multilinear rank approximations of tensors
- A log-linear time algorithm for the elastodynamic boundary integral equation method
- Black box approximation of tensors in hierarchical Tucker format
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- On optimal low rank Tucker approximation for tensors: the case for an adjustable core size
- Literature survey on low rank approximation of matrices
- Krylov-type methods for tensor computations.I
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Use of tensor formats in elliptic eigenvalue problems.
- A literature survey of low-rank tensor approximation techniques
- Quasioptimality of skeleton approximation of a matrix in the Chebyshev norm
- TT-cross approximation for multidimensional arrays
- Recursive decomposition of multidimensional tensors
- Generalised adaptive cross approximation for convolution quadrature based boundary element formulation
- Quasioptimality of maximum-volume cross interpolation of tensors
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- Factorization strategies for third-order tensors
- Cross: efficient low-rank tensor completion
- New accuracy estimates for pseudoskeleton approximations of matrices
- Tensor and its Tucker core: the invariance relationships.
- Low rank Tucker-type tensor approximation to classical potentials
- Tensor product approach to quantum control
- Fast truncation of mode ranks for bilinear tensor operations
- Randomized tensor wheel decomposition
- A note on tensor chain approximation
This page was built for publication: Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320719)
