Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Low Rank Tensor Decompositions and Approximations (2208.07477v1)

Published 16 Aug 2022 in math.NA and cs.NA

Abstract: There exist linear relations among tensor entries of low rank tensors. These linear relations can be expressed by multi-linear polynomials, which are called generating polynomials. We use generating polynomials to compute tensor rank decompositions and low rank tensor approximations. We prove that this gives a quasi-optimal low rank tensor approximation if the given tensor is sufficiently close to a low rank one.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Jiawang Nie (66 papers)
  2. Li Wang (470 papers)
  3. Zequn Zheng (3 papers)
Citations (2)

Summary

We haven't generated a summary for this paper yet.