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

Iterative Calculation of Sum Of Squares

Abstract : We propose an iterative algorithm for the calculations of sum of squares of polynomials, reformulated as positive interpolation. The method is based on the definition of a dual functional $G$. The domain of $G$, the boundary of the domain and the boundary at infinity are analyzed in details. In the general case, $G$ is closed convex. For univariate polynomials in the context of the Lukacs representation, $G$ is coercive and strictly convex which yields a unique critical point. Various descent algorithms are evoked. Numerical examples are provided, for univariate and bivariate polynomials.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01946539
Contributor : Maxime Herda Connect in order to contact the contributor
Submitted on : Friday, December 7, 2018 - 5:53:40 PM
Last modification on : Wednesday, March 23, 2022 - 3:51:22 PM
Long-term archiving on: : Friday, March 8, 2019 - 3:53:12 PM

Files

sumofsquares.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01946539, version 2
  • ARXIV : 1812.02444

Citation

Bruno Després, Maxime Herda. Iterative Calculation of Sum Of Squares. 2018. ⟨hal-01946539v2⟩

Share

Metrics

Record views

288

Files downloads

616