AI Chat AI Image Generator AI Video Text to Speech

An algebraic algorithm for rank-2 ParaTuck-2 decomposition

02/02/2023

∙

by Konstantin Usevich, et al.

∙

∙

In this note we consider the problem of ParaTuck-2 decomposition of a complex three-way tensor.We provide an algebraic algorithm for finding the rank-2 decomposition for ParaTuck-2 tensors.Our approach relies only on linear algebra operations and is based on finding the kernel of a structured matrix constructed from the tensor.

page 1

page 2

page 3

page 4

research

∙ 04/12/2021

Characterization of Decomposition of Matrix Multiplication Tensors

In this paper, the canonical polyadic (CP) decomposition of tensors that...

0 Petr Tichavský, et al. ∙

research

∙ 03/12/2021

Normal Forms for Tensor Rank Decomposition

We propose a new algorithm for computing the tensor rank decomposition o...

0 Simon Telen, et al. ∙

research

∙ 05/22/2021

Tensor products of coherent configurations

A Cartesian decomposition of a coherent configuration X is defined as a ...

0 Gang Chen, et al. ∙

research

∙ 02/14/2022

Fast algorithm for overcomplete order-3 tensor decomposition

We develop the first fast spectral algorithm to decompose a random third...

0 Jingqiu Ding, et al. ∙

research

∙ 05/11/2022

Concise tensors of minimal border rank

We determine defining equations for the set of concise tensors of minima...

0 Joachim Jelisiejew, et al. ∙

research

∙ 03/04/2016

Identifiability of an X-rank decomposition of polynomial maps

In this paper, we study a polynomial decomposition model that arises in ...

0 Pierre Comon, et al. ∙

research

∙ 03/05/2022

A Robust Spectral Algorithm for Overcomplete Tensor Decomposition

We give a spectral algorithm for decomposing overcomplete order-4 tensor...

6 Samuel B. Hopkins, et al. ∙