HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation
From MaRDI portal
Publication:2818274
DOI10.1137/15M1048628zbMath1347.65079arXiv1511.05208WikidataQ57434176 ScholiaQ57434176MaRDI QIDQ2818274
Publication date: 7 September 2016
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05208
algorithmnumerical examplesingular value decompositionerror boundtensorsTucker decompositionCUR decompositioninterpolatory decomposition
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Higher-Order QR with Tournament Pivoting for Tensor Compression ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations ⋮ A literature survey of matrix methods for data science ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Functional Tucker Approximation Using Chebyshev Interpolation ⋮ Hybrid CUR-type decomposition of tensors in the Tucker format ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Uses Software
Cites Work
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Tensor Decompositions and Applications
- TT-cross approximation for multidimensional arrays
- CUR matrix decompositions for improved data analysis
- Randomized interpolative decomposition of separated representations
- Black box low tensor-rank approximation using fiber-crosses
- Handwritten digit classification using higher order singular value decomposition
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- A New Selection Operator for the Discrete Empirical Interpolation Method---Improved A Priori Error Bound and Extensions
- A DEIM Induced CUR Factorization
- A literature survey of low-rank tensor approximation techniques
- A New Truncation Strategy for the Higher-Order Singular Value Decomposition
- Optimal CUR Matrix Decompositions
- Nonlinear Model Reduction via Discrete Empirical Interpolation
- Fast low rank approximations of matrices and tensors
- Fast Algorithms for Hyperspectral Diffuse Optical Tomography
- Relative-Error $CUR$ Matrix Decompositions
- A Multilinear Singular Value Decomposition
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order Tensors
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Generalized Rank-Constrained Matrix Approximations
- Tucker Dimensionality Reduction of Three-Dimensional Arrays in Linear Time
- Tensor-CUR Decompositions for Tensor-Based Data
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
- Conditioning of Leverage Scores and Computation by QR Decomposition
This page was built for publication: HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation