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 条
  • [21] An Extended S-polynomial for Computing Grobner Bases
    He, Jinao
    Zhong, Xiuqin
    2013 2ND INTERNATIONAL SYMPOSIUM ON INSTRUMENTATION AND MEASUREMENT, SENSOR NETWORK AND AUTOMATION (IMSNA), 2013, : 738 - 740
  • [22] Solving Polynomial Systems Using Numeric Grobner Bases
    Lichtblau, Daniel
    MATHEMATICAL SOFTWARE - ICMS 2018, 2018, 10931 : 335 - 342
  • [23] GROBNER BASES FOR THE POLYNOMIAL RING WITH INFINITE VARIABLES AND THEIR APPLICATIONS
    Iima, Kei-ichiro
    Yoshino, Yuji
    COMMUNICATIONS IN ALGEBRA, 2009, 37 (10) : 3424 - 3437
  • [24] Analogs of Grobner bases in polynomial rings over a ring
    Miller, JL
    JOURNAL OF SYMBOLIC COMPUTATION, 1996, 21 (02) : 139 - 153
  • [25] Grobner bases in asymptotic analysis of perturbed polynomial programs
    Ejov, Vladimir
    Filar, Jerzy A.
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2006, 64 (01) : 1 - 16
  • [26] Recursive construction of Grobner bases for the solution of polynomial congruences
    O'Keeffe, H
    Fitzpatrick, P
    CODES, SYSTEMS, AND GRAPHICAL MODELS, 2001, 123 : 299 - 309
  • [27] Pivoting in Extended Rings for Computing Approximate Grobner Bases
    Faugere, Jean-Charles
    Liang, Ye
    MATHEMATICS IN COMPUTER SCIENCE, 2011, 5 (02) : 179 - 194
  • [28] Structures of precision losses in computing approximate Grobner bases
    Liang, Ye
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 53 : 81 - 95
  • [29] Selecting lengths of floats for the computation of approximate Grobner bases
    Liang, Ye
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 53 : 40 - 52
  • [30] Castelnuovo theory via Grobner bases
    Petrakiev, Ivan
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 2008, 619 : 49 - 73
12345