Pages that link to "Item:Q3614817"

The following pages link to Efficient MATLAB Computations with Sparse and Factored Tensors (Q3614817):

Displaying 50 items.

• TensorToolbox (Q16369) (← links)
• TT-cross approximation for multidimensional arrays (Q126160) (← links)
• Fast stray field computation on tensor grids (Q419656) (← links)
• A gradient based iterative solutions for Sylvester tensor equations (Q474659) (← links)
• Diagonalization of tensors with circulant structure (Q541907) (← links)
• A seminorm regularized alternating least squares algorithm for canonical tensor decomposition (Q1631439) (← links)
• A new class of root-finding methods in \({\mathbb {R}}^n\): the inexact tensor-free Chebyshev-Halley class (Q1715715) (← links)
• Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
• Computing dense tensor decompositions with optimal dimension trees (Q1741867) (← links)
• Krylov-type methods for tensor computations.I (Q1931774) (← links)
• Nonnegative tensor factorizations using an alternating direction method (Q1945572) (← links)
• A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems (Q2059724) (← links)
• 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} \) (Q2068845) (← links)
• A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors (Q2084262) (← links)
• Computation of higher order Lie derivatives on the infinity computer (Q2199789) (← links)
• Extending BiCG and BiCR methods to solve the Stein tensor equation (Q2204031) (← links)
• An optimization approach for dynamical Tucker tensor approximation (Q2211045) (← links)
• Extended group finite element method (Q2227999) (← links)
• A rapid and powerful iterative method for computing inverses of sparse tensors with applications (Q2247163) (← links)
• A modified CG algorithm for solving generalized coupled Sylvester tensor equations (Q2284317) (← links)
• Nonlinear power-like iteration by polar decomposition and its application to tensor approximation (Q2309509) (← links)
• Tensor train spectral method for learning of hidden Markov models (HMM) (Q2324354) (← links)
• Numerical optimization for symmetric tensor decomposition (Q2349123) (← links)
• A projection method and Kronecker product preconditioner for solving Sylvester tensor equations (Q2392951) (← links)
• Computing extreme eigenvalues of large scale Hankel tensors (Q2399200) (← links)
• An index-aware parametric model order reduction method for parameterized quadratic differential-algebraic equations (Q2422926) (← links)
• A tensor singular values and its symmetric embedding eigenvalues (Q2448358) (← links)
• Sparsity in higher order methods for unconstrained optimization (Q2885474) (← links)
• Descent Methods for Nonnegative Matrix Factorization (Q2913167) (← links)
• A Constructive Algorithm for Decomposing a Tensor into a Finite Sum of Orthonormal Rank-1 Terms (Q2947059) (← links)
• Recent advances on the use of separated representations (Q3549856) (← links)
• Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees (Q4603494) (← links)
• High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic (Q4610135) (← links)
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions (Q4631411) (← links)
• A Practical Randomized CP Tensor Decomposition (Q4643335) (← links)
• Least squares solution of the quaternion Sylvester tensor equation (Q4965577) (← links)
• A decoupled exponential random graph model for prediction of structure and attributes in temporal social networks (Q4969799) (← links)
• Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications (Q4970200) (← links)
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format (Q5027024) (← links)
• Stochastic Gradients for Large-Scale Tensor Decomposition (Q5037555) (← links)
• A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors (Q5080089) (← links)
• Practical Leverage-Based Sampling for Low-Rank Tensor Decomposition (Q5099421) (← links)
• Multiresolution Low-rank Tensor Formats (Q5146611) (← links)
• Estimating Higher-Order Moments Using Symmetric Tensor Decomposition (Q5146702) (← links)
• FFT-based Kronecker product approximation to micromagnetic long-range interactions (Q5166406) (← links)
• Algorithm 941 (Q5177207) (← links)
• Generalized Canonical Polyadic Tensor Decomposition (Q5216247) (← links)
• Software for Sparse Tensor Decomposition on Emerging Computing Architectures (Q5230593) (← links)
• Estimation of indirectly observable Langevin states: path integral solution using statistical physics methods (Q5239421) (← links)
• Strassen's Algorithm for Tensor Contraction (Q5745128) (← links)