
TensorToolbox
 Referenced in 173 articles
[sw04185]
 Efficient MATLAB computations with sparse and factored tensors. The term tensor refers simply ... storage and computation. First, we study sparse tensors, which have the property that the vast ... elements are zero. We propose storing sparse tensors using coordinate format and describe the computational ... product of a core tensor (which itself may be dense, sparse, or factored...

Tensorlab
 Referenced in 63 articles
[sw14255]
 support for dense, sparse and incomplete data sets, tensor decompositions: canonical polyadic decomposition (CPD), multilinear...

ITensor
 Referenced in 13 articles
[sw23286]
 Tensor—is a C++ library for implementing tensor network calculations. See the list of recent ... DMRG layer; Quantum number conserving (blocksparse) tensors; same interface as dense tensors; Complex numbers...

SPLATT
 Referenced in 6 articles
[sw30093]
 SPLATT: Efficient and Parallel Sparse TensorMatrix Multiplication. Multidimensional arrays, or tensors, are increasingly ... Realworld tensors can be enormous in size and often very sparse. There ... tools capable of processing the massive sparse tensors of today and the future. This paper ... state of the art tools for sparse tensor factorization. SPLATT has a fast, parallel method...

DGL
 Referenced in 9 articles
[sw33907]
 graph learning requires new tools to support tensor computation over graphs. In this paper ... GNNs into a few generalized sparse tensor operations suitable for extensive parallelization. By advocating graph...

TiledArray
 Referenced in 2 articles
[sw12616]
 TiledArray: A MassivelyParallel, BlockSparse Tensor Library Written in C++. TiledArray is a scalable ... blocksparse tensor library that is designed to aid in rapid composition of highperformance...

AutoExtend
 Referenced in 3 articles
[sw33470]
 space as the word embeddings. A sparse tensor formalization guarantees efficiency and parallelizability...

GigaTensor
 Referenced in 6 articles
[sw23741]
 algorithm for large scale tensor decomposition. GIGATENSOR exploits the sparseness of the real world tensors...

FROSTT
 Referenced in 1 article
[sw30092]
 FROSTT: The Formidable Repository of Open Sparse Tensors and Tools. FROSTT is a collection ... publicly available sparse tensor datasets and tools. FROSTT has two primary objectives: Foster sparse tensor...

ParTI
 Referenced in 1 article
[sw30091]
 ParTI!), is to support fast essential sparse tensor operations and tensor decompositions on multicore...

TurboSMT
 Referenced in 3 articles
[sw35620]
 TurboSMT: parallel coupled sparse matrixtensor factorizations and applications. How can we correlate ... many settings of the Coupled MatrixTensor Factorization (CMTF) problem. Can we enhance any CMTF ... performance of any CMTF algorithm, produces sparse and interpretable solutions, and parallelizes any CMTF algorithm ... producing sparse and interpretable solutions (up to 65 fold). Additionally, we improve upon...

STENMIN
 Referenced in 2 articles
[sw00917]
 large and sparse. The software allows the user to select between a tensor method ... minimizing the tensor model that makes it suitable for solving large, sparse optimization problems efficiently ... test results indicate that, in general, the tensor method is often more efficient and more ... standard Newton method for solving large, sparse unconstrained optimization problems...

TensorNetwork
 Referenced in 2 articles
[sw38113]
 implementing tensor network algorithms. Tensor networks are sparse data structures originally designed for simulating quantum...

CORALS
 Referenced in 1 article
[sw34405]
 Gaussian data and multiway tensor arrays. NonGaussian data are modeled with singleparameter ... natural parameter space via sparse CANDECOMP/PARAFAC tensor decomposition. A regularized alternating (iteratively reweighted) least squares...

Spartns
 Referenced in 0 articles
[sw05822]
 Spartns is a sparse tensor representation library for Common Lisp. Tensors are a generalization...

CheMPS2
 Referenced in 4 articles
[sw17633]
 sparse block structure in the MPS ansatz and in the intermediary contracted tensors...

BTTSoftImpute
 Referenced in 1 article
[sw34805]
 technique called the block tensor train (BTT) decomposition. Given sparsely observed data points, the proposed ... scale data matrices admitting a lowrank tensor structure. An iterative softthresholding algorithm...

MEPCMP
 Referenced in 1 article
[sw33641]
 collocation points based on tensor product rule, nonnested sparse grids method or anchoredANOVA...

DFacTo
 Referenced in 6 articles
[sw31258]
 Descent (GD), two widely used algorithms for tensor factorization. By exploiting properties of the Khatri ... algorithms. Our algorithm, DFacTo, only requires two sparse matrixvector products and is easy ... million x 1.5 million dimensional tensor with 1.2 billion nonzero entries...

laplacian
 Referenced in 1 article
[sw22584]
 sparse matrix itself, using Kronecker sums of 1D Laplacians. For more information on tensor sums...