Efficient MATLAB Computations with Sparse and Factored Tensors
From MaRDI portal
Publication:3614817
DOI10.1137/060676489zbMath1159.65323OpenAlexW2108138101MaRDI QIDQ3614817
Publication date: 10 March 2009
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc877579/
tensor decompositionsTucker modelcanonical decomposition (CANDECOMP)MATLAB classesmultilinear algebraic computationsparallel factors (PARAFAC) modelsparse multidimensional arrays
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (55)
Sparsity in higher order methods for unconstrained optimization ⋮ Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ A seminorm regularized alternating least squares algorithm for canonical tensor decomposition ⋮ Descent Methods for Nonnegative Matrix Factorization ⋮ A projection method and Kronecker product preconditioner for solving Sylvester tensor equations ⋮ Computing extreme eigenvalues of large scale Hankel tensors ⋮ A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms ⋮ Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition ⋮ Krylov-type methods for tensor computations.I ⋮ An index-aware parametric model order reduction method for parameterized quadratic differential-algebraic equations ⋮ Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple ⋮ Tracking amplitude extrema of nonlinear frequency responses using the harmonic balance method ⋮ WINTENDED: WINdowed TENsor decomposition for densification event detection in time-evolving networks ⋮ Fast stray field computation on tensor grids ⋮ Computation of higher order Lie derivatives on the infinity computer ⋮ Nonnegative tensor factorizations using an alternating direction method ⋮ Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees ⋮ Extending BiCG and BiCR methods to solve the Stein tensor equation ⋮ High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic ⋮ An optimization approach for dynamical Tucker tensor approximation ⋮ A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class ⋮ A tensor singular values and its symmetric embedding eigenvalues ⋮ A gradient based iterative solutions for Sylvester tensor equations ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Extended group finite element method ⋮ Recent advances on the use of separated representations ⋮ Multiresolution Low-rank Tensor Formats ⋮ Estimating Higher-Order Moments Using Symmetric Tensor Decomposition ⋮ Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions ⋮ Computing dense tensor decompositions with optimal dimension trees ⋮ A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors ⋮ A Practical Randomized CP Tensor Decomposition ⋮ A rapid and powerful iterative method for computing inverses of sparse tensors with applications ⋮ FFT-based Kronecker product approximation to micromagnetic long-range interactions ⋮ Diagonalization of tensors with circulant structure ⋮ Algorithm 941 ⋮ Strassen's Algorithm for Tensor Contraction ⋮ A modified CG algorithm for solving generalized coupled Sylvester tensor equations ⋮ TT-cross approximation for multidimensional arrays ⋮ Q-less QR decomposition in inner product spaces ⋮ Least squares solution of the quaternion Sylvester tensor equation ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ A decoupled exponential random graph model for prediction of structure and attributes in temporal social networks ⋮ Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications ⋮ TensorToolbox ⋮ A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems ⋮ Nonlinear power-like iteration by polar decomposition and its application to tensor approximation ⋮ Software for Sparse Tensor Decomposition on Emerging Computing Architectures ⋮ Iterative methods for solving Sylvester transpose tensor equation \(\mathcal A\star_N\mathcal X\star_M\mathcal{B}+\mathcal{C}\star_M\mathcal X^T\star_N\mathcal{D}=\mathcal{E} \) ⋮ Estimation of indirectly observable Langevin states: path integral solution using statistical physics methods ⋮ Tensor train spectral method for learning of hidden Markov models (HMM) ⋮ A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors ⋮ Legendre decomposition for tensors* ⋮ Numerical optimization for symmetric tensor decomposition ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
Uses Software
This page was built for publication: Efficient MATLAB Computations with Sparse and Factored Tensors
