A New Truncation Strategy for the Higher-Order Singular Value Decomposition
From MaRDI portal
Publication:2904823
DOI10.1137/110836067zbMath1247.65055OpenAlexW2055913665WikidataQ60547190 ScholiaQ60547190MaRDI QIDQ2904823
Nick Vannieuwenhoven, Karl Meerbergen, Raf Vandebril
Publication date: 23 August 2012
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/608109b7643145d3559c962041c76207a58a3b57
tensorhigher-order singular value decompositionsequentially truncated higher-order singular value decompositionmultilinear orthogonal projectionmultilinear singular value decomposition
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Multilinear algebra, tensor calculus (15A69)
Related Items
Pass-efficient methods for compression of high-dimensional turbulent flow data ⋮ Low-Rank Tucker Approximation of a Tensor from Streaming Data ⋮ Higher-Order QR with Tournament Pivoting for Tensor Compression ⋮ Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ Inference for low-rank tensors -- no need to debias ⋮ Multilinear POD-DEIM model reduction for 2D and 3D semilinear systems of differential equations ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor ⋮ On approximation algorithm for orthogonal low-rank tensor approximation ⋮ Nonintrusive model order reduction for cross-diffusion systems ⋮ High-order tensor estimation via trains of coupled third-order CP and Tucker decompositions ⋮ Condition numbers for the tensor rank decomposition ⋮ MERACLE: constructive layer-wise conversion of a tensor train into a MERA ⋮ Effective Criteria for Specific Identifiability of Tensors and Forms ⋮ The condition number of many tensor decompositions is invariant under Tucker compression ⋮ Randomized algorithms for the computation of multilinear rank-\((\mu_1,\mu_2,\mu_3)\) approximations ⋮ Practical sketching algorithms for low-rank Tucker approximation of large tensors ⋮ Incremental algorithms for truncated higher-order singular value decompositions ⋮ Low-rank nonnegative tensor approximation via alternating projections and sketching ⋮ Recompression of Hadamard Products of Tensors in Tucker Format ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ An algorithm for the non-identifiability of rank-3 tensors ⋮ Approximating Tensor Norms via Sphere Covering: Bridging the Gap between Primal and Dual ⋮ A low-rank isogeometric solver based on Tucker tensors ⋮ Optimality conditions for Tucker low-rank tensor optimization ⋮ The partially symmetric rank-1 approximation of fourth-order partially symmetric tensors ⋮ A randomized singular value decomposition for third-order oriented tensors ⋮ Reduced order modeling for parametrized generalized Newtonian fluid flows ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence ⋮ Generalized visual information analysis via tensorial algebra ⋮ Space--Time Least-Squares Petrov--Galerkin Projection for Nonlinear Model Reduction ⋮ Recursive POD Expansion for the Advection-Diffusion-Reaction Equation ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ Nonlinearly Preconditioned Optimization on Grassmann Manifolds for Computing Approximate Tucker Tensor Decompositions ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation ⋮ Data-driven reduced order modeling based on tensor decompositions and its application to air-wall heat transfer in buildings ⋮ Unfoldings and the rank-one approximation of the tensor ⋮ Data-Driven Time Parallelism via Forecasting ⋮ Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ High order singular value decomposition for plant diversity estimation ⋮ Projection-based model reduction of dynamical systems using space-time subspace and machine learning ⋮ Iterative algorithms for the post-processing of high-dimensional data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares ⋮ Hot-SVD: higher order t-singular value decomposition for tensors based on tensor-tensor product ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Convergence of a Jacobi-type method for the approximate orthogonal tensor diagonalization ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Uses Software
