A Linearization Technique for Multivariate Polynomials Using Convex Polyhedra Based on Handelman-Krivine's Theorem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

A Linearization Technique for Multivariate Polynomials Using Convex Polyhedra Based on Handelman-Krivine's Theorem

Alexandre Maréchal
  • Function : Correspondent author
  • PersonId : 962757

Connectez-vous pour contacter l'auteur
DCS
Michaël Périn
  • Function : Author
DCS

Abstract

We present a new linearization method to over-approximate non-linear multivariate polynomials with convex polyhedra. It is based on Handelman-Krivine's theorem and consists in using products of constraints of a polyhedron to over-approximate a polynomial on this polyhedron. We implemented it together with two other linearization methods that we will not detail in this paper, but that we shall use as comparison. Our implementation in Ocaml generates certificates that can be verified by a trusted checker, certified in Coq, that guarantees the correctness of our linear approximation.
Fichier principal
Vignette du fichier
jfla15_marechal_perin.pdf (940.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01099142 , version 1 (31-12-2014)
hal-01099142 , version 2 (21-09-2015)

Identifiers

  • HAL Id : hal-01099142 , version 2

Cite

Alexandre Maréchal, Michaël Périn. A Linearization Technique for Multivariate Polynomials Using Convex Polyhedra Based on Handelman-Krivine's Theorem. Vingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France. ⟨hal-01099142v2⟩
242 View
340 Download

Share

Gmail Facebook X LinkedIn More