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)

• Extending BiCG and BiCR methods to solve the Stein tensor equation
• Further study on tensor absolute value equations
• High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic
• 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
• 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
• Absolute value equations with tensor product structure: unique solvability and numerical solution.
• 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
• Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems
• 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
• An Adaptive Algebraic Multigrid Algorithm for Low-Rank Canonical Tensor Decomposition
• 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
• Algorithm 941
• A semismooth Newton method for tensor eigenvalue complementarity problem
• A nonlinear GMRES optimization algorithm for canonical tensor decomposition
• Q-less QR decomposition in inner product spaces
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Spectral tensor-train decomposition
• A Practical Randomized CP Tensor Decomposition
• Krylov subspace methods for linear systems with tensor product structure
• Tensor-based methods for numerical homogenization from high-resolution images
• On New Classes of Nonnegative Symmetric Tensors
• Krylov subspace methods to solve a class of tensor equations via the Einstein product
• Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications
• Recompression of Hadamard Products of Tensors in Tucker Format
• A gradient based iterative solutions for Sylvester tensor equations
• Diagonalization of tensors with circulant structure
• A nonlinearly preconditioned conjugate gradient algorithm for rank‐R canonical tensor approximation
• Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Tensor Spaces and Numerical Tensor Calculus
• Fast stray field computation on tensor grids
• Tensor Decompositions and Applications
• On optimal low rank Tucker approximation for tensors: the case for an adjustable core size
• A Newton-Grassmann method for computing the best multilinear rank-\((r_1,r_2,r_3)\) approximation of a tensor
• Tensor-train decomposition for image recognition
• A locally convergent Jacobi iteration for the tensor singular value problem
• Rank properties and computational methods for orthogonal tensor decompositions
• A literature survey of low-rank tensor approximation techniques
• Reduced Models and Uncertainty Quantification
• A homotopy method for computing the largest eigenvalue of an irreducible nonnegative tensor
• Tensor Regression Using Low-Rank and Sparse Tucker Decompositions
• Numerically explicit potentials for the homogenization of nonlinear elastic heterogeneous materials
• On the convergence of higher-order orthogonal iteration
• TT-cross approximation for multidimensional arrays
• Separability criterion for multipartite quantum states based on the Bloch representation of density matrices
• On the interconnection between the higher-order singular values of real tensors
• The simplified topological \(\varepsilon\)-algorithms: software and applications
• A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms
• Nonnegative tensor factorizations using an alternating direction method
• On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
• Chebfun in Three Dimensions
• Multilinear Control Systems Theory
• Computing the generalized eigenvalues of weakly symmetric tensors
• Continuous-discrete path integral filtering
• Recursive blocked algorithms for linear systems with Kronecker product structure
• Numerical solution to a linear equation with tensor product structure
• Perturbation of Higher-Order Singular Values
• 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
• Computing Tensor $Z$-Eigenvectors with Dynamical Systems
• 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
• Nesterov acceleration of alternating least squares for canonical tensor decomposition: Momentum step size selection and restart mechanisms
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions
• 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?)

This page was built for software: TensorToolbox