Tensorlab
From MaRDI portal
Software:26160
No author found.
Related Items (85)
Algorithm 1026: Concurrent Alternating Least Squares for Multiple Simultaneous Canonical Polyadic Decompositions ⋮ Tensor Regression Using Low-Rank and Sparse Tucker Decompositions ⋮ Discovering faster matrix multiplication algorithms with reinforcement learning ⋮ Designing rational filter functions for solving eigenvalue problems by contour integration ⋮ Solving systems of polynomial equations -- a tensor approach ⋮ Efficient alternating least squares algorithms for low multilinear rank approximation of tensors ⋮ Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Rank-1 Tensor Properties with Applications to a Class of Tensor Optimization Problems ⋮ On approximation algorithm for orthogonal low-rank tensor approximation ⋮ Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer ⋮ Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors ⋮ Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ 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 ⋮ Low rank interpolation of boundary spline curves ⋮ MERACLE: constructive layer-wise conversion of a tensor train into a MERA ⋮ Design of a High-Performance GEMM-like Tensor–Tensor Multiplication ⋮ Effective identifiability criteria for tensors and polynomials ⋮ Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors ⋮ An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization ⋮ A constructive arbitrary‐degree Kronecker product decomposition of tensors ⋮ Chebfun in Three Dimensions ⋮ The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection ⋮ On Uniqueness and Computation of the Decomposition of a Tensor into Multilinear Rank-$(1,L_r,L_r)$ Terms ⋮ A \(\mu\)-mode BLAS approach for multidimensional tensor-structured problems ⋮ The Condition Number of Join Decompositions ⋮ On Orthogonal Tensors and Best Rank-One Approximation Ratio ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ An efficient solver for space-time isogeometric Galerkin methods for parabolic problems ⋮ Sixty-Four Curves of Degree Six ⋮ Randomized algorithms for the low multilinear rank approximations of tensors ⋮ Learning Paths from Signature Tensors ⋮ Exploiting Efficient Representations in Large-Scale Tensor Decompositions ⋮ Hermitian Tensor Decompositions ⋮ The Epsilon-Alternating Least Squares for Orthogonal Low-Rank Tensor Approximation and Its Global Convergence ⋮ Nonlinear eigenvalue problems and contour integrals ⋮ Robust isogeometric preconditioners for the Stokes system based on the fast diagonalization method ⋮ Convex Coupled Matrix and Tensor Completion ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Finding a low-rank basis in a matrix subspace ⋮ Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order ⋮ Perturbation analysis for matrix joint block diagonalization ⋮ On the convergence of higher-order orthogonal iteration ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Q-less QR decomposition in inner product spaces ⋮ Exact line and plane search for tensor optimization ⋮ Feature extraction from unequal length heterogeneous EHR time series via dynamic time warping and tensor decomposition ⋮ Structuring data with block term decomposition: decomposition of joint tensors and variational block term decomposition as a parametrized mixture distribution model ⋮ From exponential analysis to Padé approximation and tensor decomposition, in one and more dimensions ⋮ Symmetric tensor decomposition by an iterative eigendecomposition algorithm ⋮ An efficient randomized algorithm for computing the approximate Tucker decomposition ⋮ Space–time least–squares isogeometric method and efficient solver for parabolic problems ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor ⋮ A self-adaptive regularized alternating least squares method for tensor decomposition problems ⋮ Computing Partial Spectra with Least-Squares Rational Filters ⋮ On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations ⋮ Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable ⋮ Fiber Sampling Approach to Canonical Polyadic Decomposition and Application to Tensor Completion ⋮ Decoupling multivariate polynomials: interconnections between tensorizations ⋮ Homotopy techniques for tensor decomposition and perfect identifiability ⋮ Isogeometric Preconditioners Based on Fast Solvers for the Sylvester Equation ⋮ Riemannian Newton optimization methods for the symmetric tensor approximation problem ⋮ On large-scale dynamic topic modeling with nonnegative CP tensor decomposition ⋮ On Koopman mode decomposition and tensor component analysis ⋮ Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition ⋮ Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition ⋮ Unnamed Item ⋮ HOSVD based multidimensional parameter estimation for massive MIMO system from incomplete channel measurements ⋮ Coupled Canonical Polyadic Decompositions and (Coupled) Decompositions in Multilinear Rank- $(L_{r,n},L_{r,n},1)$ Terms---Part II: Algorithms ⋮ Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation ⋮ Unnamed Item ⋮ A Recursive Eigenspace Computation for the Canonical Polyadic Decomposition ⋮ Guarantees for Existence of a Best Canonical Polyadic Approximation of a Noisy Low-Rank Tensor ⋮ A literature survey of low-rank tensor approximation techniques ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition ⋮ Low-rank approximation to entangled multipartite quantum systems ⋮ Decoupling Multivariate Polynomials Using First-Order Information and Tensor Decompositions ⋮ Hyperspectral Super-resolution Accounting for Spectral Variability: Coupled Tensor LL1-Based Recovery and Blind Unmixing of the Unknown Super-resolution Image ⋮ Rank-1 approximation for entangled multipartite real systems ⋮ An unconventional robust integrator for dynamical low-rank approximation ⋮ Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format ⋮ Parallel Algorithms for Tensor Train Arithmetic ⋮ A linear algebra approach to OLAP
This page was built for software: Tensorlab