TensorToolbox
From MaRDI portal
TensorToolbox Q16369
Cited in
(only showing first 100 items - show all)- Dynamical low-rank approximation: Applications and numerical experiments
- TT-cross approximation for multidimensional arrays
- CP-CALS
- Genten
- taco
- TensorToolbox.jl
- KronPACK
- HOTTBOX
- PLANC
- RWPKV
- TENSOLVE
- FastFDs
- CMRH
- TANE
- SCASY
- SCCP
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- Poblano
- GGPLAB
- Accurate calculation of the geometric measure of entanglement for multipartite quantum states
- Scientific data interpolation with low dimensional manifold model
- Effective identifiability criteria for tensors and polynomials
- Weighted tridiagonal matrix enhanced multivariance products representation (WTMEMPR) for decomposition of multiway arrays: applications on certain chemical system data sets
- A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class
- A continuation method for tensor complementarity problems
- Block-diagonal approach to non-negative factorization of sparse linguistic matrices and tensors of extra-large dimension using the latent Dirichlet distribution
- Iterative criteria for identifying strong \(\mathcal{H}\)-tensors
- Spectral projected gradient methods for generalized tensor eigenvalue complementarity problems
- Alternating iterative methods for solving tensor equations with applications
- BCLS
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- Computing dense tensor decompositions with optimal dimension trees
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- Multiscale structural topology optimization with an approximate constitutive model for local material microstructure
- cross2D
- BiCOR
- CORS
- MADNESS
- APNN-Toolbox
- Krylov-type methods for tensor computations.I
- Algorithm 862
- Nonnegative tensor factorizations using an alternating direction method
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- Tensor absolute value equations
- 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
- NMFLAB
- An index detecting algorithm for a class of TCP \((\mathcal{A},q)\) equipped with nonsingular \(\mathcal{M}\)-tensors
- A nonnegativity preserving algorithm for multilinear systems with nonsingular \(\mathcal{M}\)-tensors
- A lower dimensional linear equation approach to the m-tensor complementarity problem
- Numerical study on Moore-Penrose inverse of tensors via Einstein product
- A modified LM algorithm for tensor complementarity problems over the circular cone
- Newton's method for M-tensor equations
- An efficient randomized algorithm for computing the approximate Tucker decomposition
- Manopt
- Multi-aspect renewable energy forecasting
- 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
- Daisy
- 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} \)
- 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
- GCROT
- ALPS
- Absolute value equations with tensor product structure: unique solvability and numerical solution.
- A smoothing Newton method preserving nonnegativity for solving tensor complementarity problems with \(P_0\) mappings
- Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
- htucker
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
- Tensor-train decomposition for image recognition
- A nonlinear reduced order model with parametrized shape defects
- A tensor format for the generalized Hessenberg method for solving Sylvester tensor equations
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- Recursive blocked algorithms for linear systems with Kronecker product structure
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
- A two-step accelerated Levenberg-Marquardt method for solving multilinear systems in tensor-train format
- Computation of higher order Lie derivatives on the infinity computer
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- An optimization approach for dynamical Tucker tensor approximation
- Anomaly detection in scientific data using joint statistical moments
- Randomized algorithms for the low multilinear rank approximations of tensors
- Extended group finite element method
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- A rapid and powerful iterative method for computing inverses of sparse tensors with applications
- A unified tensor framework for face recognition
- Finding Nash equilibrium for a class of multi-person noncooperative games via solving tensor complementarity problem
- DNAD
- A modified CG algorithm for solving generalized coupled Sylvester tensor equations
- Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
- Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
- Linearized methods for tensor complementarity problems
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors
- A descent cautious BFGS method for computing US-eigenvalues of symmetric complex tensors
- Nonlinear power-like iteration by polar decomposition and its application to tensor approximation
- Decoupling multivariate polynomials: interconnections between tensorizations
- Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies
- An algorithm for computing the spectral radius of nonnegative tensors
This page was built for software: TensorToolbox