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 条
  • [41] New Operated Polynomial Identities and Grobner-Shirshov Bases
    Wang, Jinwei
    Zhu, Zhicheng
    Gao, Xing
    MATHEMATICS, 2022, 10 (06)
  • [42] Finite Grobner bases in infinite dimensional polynomial rings and applications
    Hillar, Christopher J.
    Sullivant, Seth
    ADVANCES IN MATHEMATICS, 2012, 229 (01) : 1 - 25
  • [43] Inference of Polynomial Invariants for Imperative Programs: A Farewell to Grobner Bases
    Cachera, David
    Jensen, Thomas
    Jobin, Arnaud
    Kirchner, Florent
    STATIC ANALYSIS, SAS 2012, 2012, 7460 : 58 - 74
  • [44] From an approximate to an exact absolute polynomial factorization
    Cheze, Guillaume
    Galligo, Andre
    JOURNAL OF SYMBOLIC COMPUTATION, 2006, 41 (06) : 682 - 696
  • [45] Taylor and Lyubeznik resolutions via Grobner bases
    Seiler, WM
    JOURNAL OF SYMBOLIC COMPUTATION, 2002, 34 (06) : 597 - 608
  • [46] Multiplication in the cohomology of Grassmannians via Grobner bases
    Petrovic, Zoran Z.
    Prvulovic, Branislav I.
    Radovanovic, Marko
    JOURNAL OF ALGEBRA, 2015, 438 : 60 - 84
  • [47] QUILLEN HOMOLOGY FOR OPERADS VIA GROBNER BASES
    Dotsenko, Vladimir
    Khoroshkin, Anton
    DOCUMENTA MATHEMATICA, 2013, 18 : 707 - 747
  • [48] Polynomial GCD
    Bruckman, PS
    FIBONACCI QUARTERLY, 1998, 36 (05): : 472 - 472
  • [49] Computing μ-Bases of Univariate Polynomial Matrices Using Polynomial Matrix Factorization
    HUANG Bingru
    CHEN Falai
    Journal of Systems Science & Complexity, 2021, 34 (03) : 1189 - 1206
  • [50] Computing μ-Bases of Univariate Polynomial Matrices Using Polynomial Matrix Factorization
    Huang Bingru
    Chen Falai
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2021, 34 (03) : 1189 - 1206
12345