Tensorlab

swMATH14255MaRDI QIDQ26160FDOQ26160

Author name not available (Why is that?)

Cited In (85)

• Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
• 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
• Algorithm 1026: Concurrent Alternating Least Squares for Multiple Simultaneous Canonical Polyadic Decompositions
• A recursive eigenspace computation for the canonical polyadic decomposition
• Guarantees for existence of a best canonical polyadic approximation of a noisy low-rank tensor
• New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
• Title not available (Why is that?)
• MERACLE: constructive layer-wise conversion of a tensor train into a MERA
• Convex coupled matrix and tensor completion
• Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition
• Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
• Exact line and plane search for tensor optimization
• Space–time least–squares isogeometric method and efficient solver for parabolic problems
• Robust isogeometric preconditioners for the Stokes system based on the fast diagonalization method
• Symmetric tensor decomposition by an iterative eigendecomposition algorithm
• 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
• 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
• An efficient solver for space-time isogeometric Galerkin methods for parabolic problems
• Rank-1 approximation for entangled multipartite real systems
• Perturbation analysis for matrix joint block diagonalization
• On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• 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
• Time integration of symmetric and anti-symmetric low-rank matrices and Tucker tensors
• 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
• Solving systems of polynomial equations -- a tensor approach
• Hermitian tensor decompositions
• 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
• Learning paths from signature tensors
• 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
• 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
• 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
• Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
• 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
• The epsilon-alternating least squares for orthogonal low-rank tensor approximation and its global convergence
• Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
• Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
• Riemannian Newton optimization methods for the symmetric tensor approximation problem
• Shifted eigenvalue decomposition method for computing C-eigenvalues of a piezoelectric-type tensor
• Randomized algorithms for the low multilinear rank approximations of tensors
• Low rank interpolation of boundary spline curves
• Solving polynomial systems via truncated normal forms
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Title not available (Why is that?)
• Nonlinear eigenvalue problems and contour integrals
• A Riemannian trust region method for the canonical tensor rank approximation problem
• HOSVD based multidimensional parameter estimation for massive MIMO system from incomplete channel measurements
• A literature survey of low-rank tensor approximation techniques
• A linear algebra approach to OLAP
• On large-scale dynamic topic modeling with nonnegative CP tensor decomposition
• 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
• Flow-based dissimilarity measures for reservoir models: a spatial-temporal tensor approach
• Decoupling multivariate polynomials: interconnections between tensorizations
• A self-adaptive regularized alternating least squares method for tensor decomposition problems
• An unconventional robust integrator for dynamical low-rank approximation
• 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

This page was built for software: Tensorlab