On the complexity of finding tensor ranks

Printable PDF

Department of Mathematics,
University of California San Diego

****************************

Math 278C: Optimization and Data Science

Prof. Mohsen Aliabadi

UCSD

Abstract:

The purpose of this talk is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $F$ is at most $k$ over the algebraic closure of $F$, where $k$ is a given positive integer. We estimate the arithmetic complexity of our algorithm.

Host: Jiawang Nie

February 15, 2023

3:00 PM

https://urldefense.com/v3/https://ucsd.zoom.us/j/94030298286?pwd=TTk1bi9QY1liS1VVbGdPMnVPTXc3dz09;!!Mih3wA!BT_ckWrzqwwdVYP5xmkcOy_6CV45-C-JIFgWOHWERmP24OGRzRPS9LPsx9vmhk7KPILFG1jdq9J_dQ$
Meeting ID: 940 3029 8286
Password: 278CWN23