Computing Parametric Geometric Resolutions
Computing Parametric Geometric Resolutions
复制标题
DOI:
10.1007/s00200-002-0109-x
复制
发表时间:
2003-02
期刊:
影响因子:
--
通讯作者:
É. Schost
中科院分区:
文献类型:
--
作者:
É. Schost
Given a polynomial system ofnequations innunknowns that depends on some parameters, we define the notion ofparametric geometric resolutionas a means to represent some generic solutions in terms of the parameters.The coefficients of this resolution are rational functions of the parameters; we first show that their degree is bounded by the Bézout numberdn, wheredis a bound on the degrees of the input system. Then we present a probabilistic algorithm to compute a parametric resolution. Its complexity is polynomial in the size of the output and in the complexity of evaluation of the input system. The probability of success is controlled by a quantity polynomial in the Bézout number.We present several applications of this process, notably to computa- tions in the Jacobian of hyperelliptic curves and to questions of real geometry.