Polynomial GCD and Factorization Via Approximate Grobner Bases

被引：3
|
作者：
Lichtblau, Daniel [1 ]
机构：
[1] Wolfram Res, Champaign, IL 61820 USA
来源：
12TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2010) | 2011年
关键词：
Grobner basis; polynomial gcd; hybrid symbolic-numeric computation;
D O I：
10.1109/SYNASC.2010.76
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We discuss computation of approximate Grobner bases at finite precision. We show how this can be used to deduce exact results for polynomial greatest common divisors and factorization. In particular we indicate an algorithm for factoring multivariate polynomials over the closure algebraic of the rationals.
引用
收藏
页码：29 / 36
页数：8
相关论文
共 50 条
  • [31] Multiplicative bases, Grobner bases, and right Grobner bases
    Green, EL
    JOURNAL OF SYMBOLIC COMPUTATION, 2000, 29 (4-5) : 601 - 623
  • [32] Approximate polynomial gcd: Small degree and small height perturbations
    von zur Gathen, Joachim
    Mignotte, Maurice
    Shparlinski, Igor E.
    JOURNAL OF SYMBOLIC COMPUTATION, 2010, 45 (08) : 879 - 886
  • [33] Approximate polynomial gcd: Small degree and small height perturbations
    von zur Catheni, Joachim
    Shparlinski, Igor E.
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 276 - +
  • [34] The Grobner Bases Algorithm and its Application in Polynomial Ideal Theory
    Wang, Hai
    Zhang, Lei
    Wang, Qiong
    Yan, Shi
    PROCEEDINGS OF THE 2019 31ST CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2019), 2019, : 494 - 499
  • [35] Inference of polynomial invariants for imperative programs: A farewell to Grobner bases
    Cachera, David
    Jensen, Thomas
    Jobin, Arnaud
    Kirchner, Florent
    SCIENCE OF COMPUTER PROGRAMMING, 2014, 93 : 89 - 109
  • [36] The Hilbert zonotope and a polynomial time algorithm for universal Grobner bases
    Babson, E
    Onn, S
    Thomas, R
    ADVANCES IN APPLIED MATHEMATICS, 2003, 30 (03) : 529 - 544
  • [37] EXPLOITING CHORDAL STRUCTURE IN POLYNOMIAL IDEALS: A GROBNER BASES APPROACH
    Cifuentes, Diego
    Parrilo, Pablo A.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2016, 30 (03) : 1534 - 1570
  • [38] Solving polynomial equations for chemical problems using Grobner bases
    Minimair, M
    Barnett, MP
    MOLECULAR PHYSICS, 2004, 102 (23-24) : 2521 - 2535
  • [39] Dimension-dependent bounds for Grobner bases of polynomial ideals
    Mayr, Ernst W.
    Ritscher, Stephan
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 49 : 78 - 94
  • [40] Solving Sparse Polynomial Systems using Grobner Bases and Resultants
    Bender, Matias R.
    PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, 2022, : 21 - 30
12345