Tensorlab

swMATH14255MaRDI QIDQ26160FDOQ26160

Author name not available (Why is that?)

Official website: http://www.tensorlab.net/

Cited In (only showing first 100 items - show all)

• Robust isogeometric preconditioners for the Stokes system based on the fast diagonalization method
• Symmetric tensor decomposition by an iterative eigendecomposition algorithm
• RandNLA
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order
• An efficient solver for space-time isogeometric Galerkin methods for parabolic problems
• Perturbation analysis for matrix joint block diagonalization
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
• Randomized algorithms for the approximations of Tucker and the tensor train decompositions
• Effective identifiability criteria for tensors and polynomials
• Exploiting Efficient Representations in Large-Scale Tensor Decompositions
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Designing rational filter functions for solving eigenvalue problems by contour integration
• Sixty-four curves of degree six
• Pencil-based algorithms for tensor rank decomposition are not stable
• Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
• An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
• The condition number of join decompositions
• Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions
• Homotopy techniques for tensor decomposition and perfect identifiability
• Design of a high-performance GEMM-like tensor-tensor multiplication
• Isogeometric preconditioners based on fast solvers for the Sylvester equation
• Computing partial spectra with least-squares rational filters
• Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
• From exponential analysis to Padé approximation and tensor decomposition, in one and more dimensions
• On Orthogonal Tensors and Best Rank-One Approximation Ratio
• Discovering faster matrix multiplication algorithms with reinforcement learning
• Q-less QR decomposition in inner product spaces
• Low rank tensor recovery via iterative hard thresholding
• BCLS
• cross2D
• GeoPDEs
• MADNESS
• Algorithm 862
• htucker
• CIRR
• N-way Toolbox
• ERPWAVELAB
• TT Toolbox
• TensorCalculus
• Multilinear Engine
• Complex Optimization Toolbox
• PARAFAC
• MCTDH
• TenEig
• TTC
• On approximation algorithm for orthogonal low-rank tensor approximation
• A preconditioning strategy for linear systems arising from nonsymmetric schemes in isogeometric analysis
• Computing the unique CANDECOMP/PARAFAC decomposition of unbalanced tensors by homotopy method
• insulate
• GigaTensor
• TensorLy
• TuckerMPI
• TKPSVD
• FROSTT
• SPLATT
• DFacTo
• rTensor
• Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
• signature-invariants
• Riemannian Newton optimization methods for the symmetric tensor approximation problem
• FASTA
• TensorBox
• Low rank interpolation of boundary spline curves
• TensorD
• ATC
• MultiVis
• CP-CALS
• KronPACK
• taco
• Solving polynomial systems via truncated normal forms
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Nonlinear eigenvalue problems and contour integrals
• HOSVD based multidimensional parameter estimation for massive MIMO system from incomplete channel measurements
• AlphaTensor
• PLANC
• A literature survey of low-rank tensor approximation techniques
• A linear algebra approach to OLAP
• TensorToolbox.jl
• Tensor Regression Using Low-Rank and Sparse Tucker Decompositions
• On the convergence of higher-order orthogonal iteration
• Low-rank approximation to entangled multipartite quantum systems
• A self-adaptive regularized alternating least squares method for tensor decomposition problems
• Finding a low-rank basis in a matrix subspace
• A constructive arbitrary-degree Kronecker product decomposition of tensors.
• A \(\mu\)-mode BLAS approach for multidimensional tensor-structured problems
• Rank-1 tensor properties with applications to a class of tensor optimization problems
• Chebfun in Three Dimensions
• Space–time least–squares isogeometric method and efficient solver for parabolic problems
• Hyperspectral Super-resolution Accounting for Spectral Variability: Coupled Tensor LL1-Based Recovery and Blind Unmixing of the Unknown Super-resolution Image
• Parallel Algorithms for Tensor Train Arithmetic
• Rank-1 approximation for entangled multipartite real systems
• Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
• Solving systems of polynomial equations -- a tensor approach
• Hermitian tensor decompositions
• On Koopman mode decomposition and tensor component analysis
• On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms
• Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition

This page was built for software: Tensorlab