On the computation of asymptotic critical values of polynomial maps and applications
share
Let 𝐟 = (f_1, …, f_p) be a polynomial tuple in ℚ[z_1, …, z_n] and let d = max_1 ≤ i ≤ p f_i. We consider the problem of computing the set of asymptotic critical values of the polynomial mapping, with the assumption that this mapping is dominant, 𝐟: z ∈𝕂^n → (f_1(z), …, f_p(z)) ∈𝕂^p where 𝕂 is either ℝ or ℂ. This is the set of values c in the target space of 𝐟 such that there exists a sequence of points (𝐱_i)_i∈ℕ for which 𝐟(𝐱_i) tends to c and 𝐱_iκ d𝐟(𝐱_i)) tends to 0 when i tends to infinity where d𝐟 is the differential of 𝐟 and κ is a function measuring the distance of a linear operator to the set of singular linear operators from 𝕂^n to 𝕂^p. Computing the union of the classical and asymptotic critical values allows one to put into practice generalisations of Ehresmann's fibration theorem. This leads to natural and efficient applications in polynomial optimisation and computational real algebraic geometry. Going back to previous works by Kurdyka, Orro and Simon, we design new algorithms to compute asymptotic critical values. Through randomisation, we introduce new geometric characterisations of asymptotic critical values. This allows us to dramatically reduce the complexity of computing such values to a cost that is essentially O(d^2n(p+1)) arithmetic operations in ℚ. We also obtain tighter degree bounds on a hypersurface containing the asymptotic critical values, showing that the degree is at most p^n-p+1(d-1)^n-p(d+1)^p. Next, we show how to apply these algorithms to unconstrained polynomial optimisation problems and the problem of computing sample points per connected component of a semi-algebraic set defined by a single inequality/inequation. We report on the practical capabilities of our implementation of this algorithm. It shows how the practical efficiency surpasses the current state-of-the-art algorithms for computing asymptotic critical values by tackling examples that were previously out of reach.
READ FULL TEXT