Iterative Calculation of Sum Of Squares
Résumé
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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|