Decomposition Algorithms for Tensors and Polynomials

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present new methods to compute the decomposition of a general plane quintic in seven powers, and of a general space cubic in five powers; the two decompositions of a general plane sextic of rank nine, and the five decompositions of a general plane septic. Furthermore, we give Magma implementations of all our algorithms.

Cite

CITATION STYLE

APA

Laface, A., Massarenti, A., & Rischter, R. (2023). Decomposition Algorithms for Tensors and Polynomials. SIAM Journal on Applied Algebra and Geometry, 7(1), 264–290. https://doi.org/10.1137/21M1453712

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free