2000 character limit reached
Three decompositions of symmetric tensors have similar condition numbers
Published 8 Oct 2021 in math.NA and cs.NA | (2110.04172v1)
Abstract: We relate the condition numbers of computing three decompositions of symmetric tensors: the canonical polyadic decomposition, the Waring decomposition, and a Tucker-compressed Waring decomposition. Based on this relation we can speed up the computation of these condition numbers by orders of magnitude
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.