swMATH4185MaRDI QIDQ16369FDOQ16369
Author name not available (Why is that?)
Official website: http://www.sandia.gov/~tgkolda/TensorToolbox/index-2.5.html
Cited In (only showing first 100 items - show all)
- A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings
- Stochastic gradients for large-scale tensor decomposition
- 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
- Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
- Time integration of tree tensor networks
- 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
- A randomized singular value decomposition for third-order oriented tensors
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- 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
- An inequality for the Perron pair of an irreducible and symmetric nonnegative tensor with application
- A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems
- 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
- A nonlinear reduced order model with parametrized shape defects
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- FINITE ITERATIVE ALGORITHM FOR THE COMPLEX GENERALIZED SYLVESTER TENSOR EQUATIONS
- 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
- 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
- A convergent Newton algorithm for computing Z-eigenvalues of an almost nonnegative irreducible tensor
- 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.
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
- Newton's method for M-tensor equations
- A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications
- Randomized algorithms for the low multilinear rank approximations of tensors
- 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
- Generalized canonical polyadic tensor decomposition
- A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
- 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} \)
- Title not available (Why is that?)
- Nonlinearly preconditioned optimization on Grassmann manifolds for computing approximate Tucker tensor decompositions
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- TP model transformation via sequentially truncated higher-order singular value decomposition
- Decoupling multivariate polynomials: interconnections between tensorizations
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors
- Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side
- 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 descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- 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
- 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
- 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
- Online tensor methods for learning latent variable models
- Numerical optimization for symmetric tensor decomposition
- 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
- 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 seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Title not available (Why is that?)
- 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
- Video watermarking using wavelet transform and tensor algebra
- Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
- Alternating iterative methods for solving tensor equations with applications
- An adaptive gradient method for computing generalized tensor eigenpairs
This page was built for software: TensorToolbox
