Computing the volume of compact semi-algebraic sets

Pierre Lairez 1 Marc Mezzarobba 2 Mohab Safey El Din 3
2 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
3 PolSys - Polynomial Systems
Inria de Paris, LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and an integer $p\geq 0$ and returns the $n$-dimensional volume of $S$ at absolute precision $2^{-p}$. Our algorithm relies on the relationship between volumes of semi-algebraic sets and periods of rational integrals. It makes use of algorithms computing the Picard-Fuchs differential equation of appropriate periods, properties of critical points, and high-precision numerical integration of differential equations. The algorithm runs in essentially linear time with respect to~$p$. This improves upon the previous exponential bounds obtained by Monte-Carlo or moment-based methods. Assuming a conjecture of Dimca, the arithmetic cost of the algebraic subroutines for computing Picard-Fuchs equations and critical points is singly exponential in $n$ and polynomial in the maximum degree of the input.
Document type :
Conference papers
Complete list of metadatas
Contributor : Marc Mezzarobba <>
Submitted on : Thursday, April 25, 2019 - 2:27:05 PM
Last modification on : Wednesday, May 15, 2019 - 3:31:56 AM


Files produced by the author(s)


  • HAL Id : hal-02110556, version 1
  • ARXIV : 1904.11705


Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din. Computing the volume of compact semi-algebraic sets. ISSAC 2019 - International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. ⟨hal-02110556⟩



Record views


Files downloads