Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A nearly optimal algorithm to decompose binary forms

Abstract : Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous polynomials, that is to write a homogeneous polynomial in n variables of degree D as a sum of D-th powers of linear forms, using the minimal number of summands. This minimal number is called the rank of the polynomial/tensor. We focus on decomposing binary forms, a problem that corresponds to the decomposition of symmetric tensors of dimension 2 and order D. Under this formulation, the problem finds its roots in invariant theory where the decompositions are known as canonical forms. In this context many different algorithms were proposed. We introduce a superfast algorithm that improves the previous approaches with results from structured linear algebra. It achieves a softly linear arithmetic complexity bound. To the best of our knowledge, the previously known algorithms have at least quadratic complexity bounds. Our algorithm computes a symbolic decomposition in $O(M(D) log(D))$ arithmetic operations, where $M(D)$ is the complexity of multiplying two polynomials of degree D. It is deterministic when the decomposition is unique. When the decomposition is not unique, our algorithm is randomized. We present a Monte Carlo version of it and we show how to modify it to a Las Vegas one, within the same complexity. From the symbolic decomposition, we approximate the terms of the decomposition with an error of $2^{−ε}$ , in $O(D log^2(D) (log^2(D) + log(ε)))$ arithmetic operations. We use results from Kaltofen and Yagati (1989) to bound the size of the representation of the coefficients involved in the decomposition and we bound the algebraic degree of the problem by min(rank, D − rank + 1). We show that this bound can be tight. When the input polynomial has integer coefficients, our algorithm performs, up to poly-logarithmic factors, $O_{bit} (Dℓ + D^4 + D^3 τ)$ bit operations, where $τ$ is the maximum bitsize of the coefficients and $2^{−ℓ}$ is the relative error of the terms in the decomposition.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [50 references]  Display  Hide  Download
Contributor : Matías Bender <>
Submitted on : Wednesday, September 11, 2019 - 12:45:24 PM
Last modification on : Tuesday, March 23, 2021 - 9:28:03 AM
Long-term archiving on: : Friday, February 7, 2020 - 9:19:54 PM


Files produced by the author(s)


  • HAL Id : hal-01907777, version 3
  • ARXIV : 1810.12588


Matías Bender, Jean-Charles Faugère, Ludovic Perret, Elias Tsigaridas. A nearly optimal algorithm to decompose binary forms. 2019. ⟨hal-01907777v3⟩



Record views


Files downloads