首页> 外文会议>International Symposium on Symbolic and Algebraic Computation Aug 3-6, 2003 Philadelphia, Pennsylvania, USA >Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set
【24h】

Polar Varieties and Computation of one Point in each Connected Component of a Smooth Real Algebraic Set

机译:光滑实代数集的每个连通分量的极点多样性和一个点的计算

获取原文
获取原文并翻译 | 示例

摘要

Let /f_1, ..., f_s be polynomials in Q[X_1,.... X_n] that generate a radical ideal and let V be their complex zero-set. Suppose that V is smooth and equidimensional; then we show that computing suitable sections of the polar varieties associated to generic projections of V gives at least one point in each connected component of V ∩ R~n. We deduce an algorithm that extends that of Bank, Giusti, Heintz and Mbakop to non-compact situations. Its arithmetic complexity is polynomial in the complexity of evaluation of the input system, an intrinsic algebraic quantity and a combinatorial quantity.
机译:令/ f_1,...,f_s为Q [X_1,.... X_n]中的多项式,这些多项式生成一个根理想,并使V为其复零集。假设V是光滑的和等维的;然后我们表明,计算与V的一般投影相关的极地变种的适当部分,可以在V∩R〜n的每个连通分量中至少给出一个点。我们推导了一种将Bank,Giusti,Heintz和Mbakop的算法扩展到非紧凑情况的算法。它的算术复杂度是输入系统评估的复杂度,内在代数量和组合量的多项式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号