TensorToolbox

swMATH4185MaRDI QIDQ16369FDOQ16369

Author name not available (Why is that?)

Described by source

• Efficient MATLAB Computations with Sparse and Factored Tensors

Cited In (only showing first 100 items - show all)

• Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
• A continuation method for tensor complementarity problems
• An algorithm for computing the spectral radius of nonnegative tensors
• Multi-aspect renewable energy forecasting
• Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
• Computing dense tensor decompositions with optimal dimension trees
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions
• Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
• Online tensor methods for learning latent variable models
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Extended group finite element method
• Weighted tridiagonal matrix enhanced multivariance products representation (WTMEMPR) for decomposition of multiway arrays: applications on certain chemical system data sets
• A unified tensor framework for face recognition
• A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors
• A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
• Title not available (Why is that?)
• An inequality for the Perron pair of an irreducible and symmetric nonnegative tensor with application
• Video watermarking using wavelet transform and tensor algebra
• A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems
• Alternating iterative methods for solving tensor equations with applications
• A tensor singular values and its symmetric embedding eigenvalues
• Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
• Design of a high-performance GEMM-like tensor-tensor multiplication
• Optimal quantum states for frequency estimation
• A nonlinear reduced order model with parametrized shape defects
• Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
• Computation of higher order Lie derivatives on the infinity computer
• An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors
• Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
• A modified CG algorithm for solving generalized coupled Sylvester tensor equations
• Software for Sparse Tensor Decomposition on Emerging Computing Architectures
• Perturbation of higher-order singular values
• A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
• A lower dimensional linear equation approach to the m-tensor complementarity problem
• Strassen's Algorithm for Tensor Contraction
• Computing tensor \(Z\)-eigenvectors with dynamical systems
• Numerical study on Moore-Penrose inverse of tensors via Einstein product
• A modified LM algorithm for tensor complementarity problems over the circular cone
• A fast alternating least squares method for third-order tensors based on a compression procedure
• Numerical solution to a linear equation with tensor product structure.
• Nesterov acceleration of alternating least squares for canonical tensor decomposition: momentum step size selection and restart mechanisms.
• Orthogonal decomposition of tensor trains
• Newton's method for M-tensor equations
• Randomized algorithms for the low multilinear rank approximations of tensors
• Accurate calculation of the geometric measure of entanglement for multipartite quantum states
• Steepest descent preconditioning for nonlinear GMRES optimization
• Descent methods for nonnegative matrix factorization
• Some iterative approaches for Sylvester tensor equations. II: A tensor format of simpler variant of GCRO-based methods
• Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES
• Scientific data interpolation with low dimensional manifold model
• A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
• Krylov-type methods for tensor computations.I
• Nonlinearly preconditioned optimization on Grassmann manifolds for computing approximate Tucker tensor decompositions
• PLANC
• A two-step accelerated Levenberg-Marquardt method for solving multilinear systems in tensor-train format
• TP model transformation via sequentially truncated higher-order singular value decomposition
• Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
• Linearized methods for tensor complementarity problems
• An iterative algorithm to solve the generalized Sylvester tensor equations
• Least squares solution of the quaternion Sylvester tensor equation
• A \(\mu\)-mode BLAS approach for multidimensional tensor-structured problems
• A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
• Extending BiCG and BiCR methods to solve the Stein tensor equation
• Further study on tensor absolute value equations
• Low-rank tensor completion by Riemannian optimization
• A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
• An equi-directional generalization of adaptive cross approximation for higher-order tensors
• A nonmonotone spectral projected gradient method for tensor eigenvalue complementarity problems
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• Dynamical low-rank approximation: Applications and numerical experiments
• Generalizing the column-row matrix decomposition to multi-way arrays
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
• Alternating proximal gradient method for sparse nonnegative Tucker decomposition
• A new truncation strategy for the higher-order singular value decomposition
• Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
• Reduced models and uncertainty quantification
• Effective identifiability criteria for tensors and polynomials
• Recent advances on the use of separated representations
• Numerical optimization for symmetric tensor decomposition
• Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
• Tensor absolute value equations
• Multiscale structural topology optimization with an approximate constitutive model for local material microstructure
• A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• A nonlinearly preconditioned conjugate gradient algorithm for rank-\(R\) canonical tensor approximation.
• Absolute value equations with tensor product structure: unique solvability and numerical solution.
• On new classes of nonnegative symmetric tensors
• Computing extreme eigenvalues of large scale Hankel tensors
• Dynamic background modeling using tensor representation and ant colony optimization
• Minimum \( n\)-rank approximation via iterative hard thresholding
• Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
• An adaptive gradient method for computing generalized tensor eigenpairs
• Solution of Linear Systems and Matrix Inversion in the TT-Format
• Randomized interpolative decomposition of separated representations
• A homotopy method for solving multilinear systems with M-tensors
• Reductive enhanced multivariance product representation for multi-way arrays
• A semismooth Newton method for tensor eigenvalue complementarity problem

This page was built for software: TensorToolbox