首页> 外文期刊>Theoretical computer science >Real algebraic numbers and polynomial systems of small degree
【24h】

Real algebraic numbers and polynomial systems of small degree

机译:实数的小数代数和多项式系统

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

摘要

Based on precomputed Sturm-Habicht sequences, discriminants and invariants, we classify, isolate with rational points, and compare the real roots of polynomials of degree up to 4. In particular, we express all isolating points as rational functions of the input polynomial coefficients. Although the roots are algebraic numbers and can be expressed by radicals, such representation involves some roots of complex numbers. This is inefficient, and hard to handle in applications in geometric computing and quantifier elimination. We also define rational isolating points between the roots of the quintic. We combine these results with a simple version of Rational Univariate Representation to isolate all common real roots of a bivariate system of rational polynomials of total degree ≤2 and to compute the multiplicity of these roots. We present our software within library SYNAPS and perform experiments and comparisons with several public-domain implementations. Our package is 2-10 times faster than numerical methods and exact subdivision-based methods, including software with intrinsic filtering.
机译:基于预先计算的Sturm-Habicht序列,判别式和不变量,我们对有理点进行分类,隔离,并比较次幂多项式的实根。最大程度为4。特别是,我们将所有隔离点都表示为输入多项式系数的有理函数。尽管根是代数数,并且可以用部首表示,但是这种表示涉及复数的一些根。这效率低下,并且在几何计算和量词消除的应用中很难处理。我们还定义了五次方根之间的有理隔离点。我们将这些结果与有理单变量表示的简单版本相结合,以隔离总度数≤2的有理多项式双变量系统的所有常见实根,并计算这些根的多重性。我们在SYNAPS库中展示我们的软件,并与几种公共领域的实现方式进行实验和比较。我们的软件包比数值方法和精确的基于细分的方法(包括具有固有过滤功能的软件)快2到10倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号