| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
A Linearization Technique for Multivariate Polynomials Using Convex Polyhedra Based on Handelman-Krivine's Theorem
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.
Cited literature [11 references]
https://hal.inria.fr/hal-01099142
Contributor : Alexandre Maréchal <>
Submitted on : Monday, September 21, 2015 - 9:02:49 AM
Last modification on : Thursday, November 19, 2020 - 3:58:03 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 8:53:48 AM
Contributor : Alexandre Maréchal <>
Submitted on : Monday, September 21, 2015 - 9:02:49 AM
Last modification on : Thursday, November 19, 2020 - 3:58:03 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 8:53:48 AM
File
jfla15_marechal_perin.pdf
Files produced by the author(s)