Properness Defects of Projection and Minimal Discriminant Variety

Guillaume Moroz 1
1 SALSA - Solvers for Algebraic Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : The problem of describing the solutions of a polynomial system appears in many different fields such as robotic, control theory, etc. When the system depends on parameters, its minimal discriminant variety is the set of parameter values around which the roots of the system cannot be expressed as a continuous function of the parameters. In particular, an important component of the minimal discriminant variety is the set of properness defects. This article presents a method efficient in practice and in theory to compute the non-properness set of a projection mapping, by reducing the problem to a problem of variable elimination. We also present a reduction of the computation of the minimal discriminant variety to the computation of the non-properness set of a projection mapping. This result allows us to deduce a bound on the degree and the time computation of the minimal discriminant variety of a parametric system under some assumptions.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01148309
Contributor : Lip6 Publications <>
Submitted on : Monday, May 4, 2015 - 1:36:10 PM
Last modification on : Thursday, March 21, 2019 - 2:54:42 PM

Links full text

Identifiers

Citation

Guillaume Moroz. Properness Defects of Projection and Minimal Discriminant Variety. Journal of Symbolic Computation, Elsevier, 2011, 46 (10), pp.1139 - 1157. ⟨10.1016/j.jsc.2011.05.013⟩. ⟨hal-01148309⟩

Share

Metrics

Record views

201