From an approximate to an exact absolute polynomial factorization

被引：15
|
作者：
Cheze, Guillaume [1 ]
Galligo, Andre [1 ]
机构：
[1] Univ Nice, Math Lab, F-06108 Nice 2, France
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2006年 / 41卷 / 06期
关键词：
absolute factorization; algebraic integers; vandermonde matrix;
D O I：
10.1016/j.jsc.2005.11.004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebraic integers over Z and is certified. It relies on a study of the perturbations in a Vandermonde system. We provide a sufficient condition on the precision of the approximate factors, depending only on the height and the degree of the polynomial. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码：682 / 696
页数：15
相关论文
共 50 条
  • [41] From approximate to exact integer programmingFrom approximate to exact integer programmingD. Dadush et al.
    Daniel Dadush
    Friedrich Eisenbrand
    Thomas Rothvoss
    Mathematical Programming, 2025, 210 (1) : 223 - 241
  • [42] Integral polytopes and polynomial factorization
    Koyuncu, Fatih
    TURKISH JOURNAL OF MATHEMATICS, 2013, 37 (01) : 18 - 26
  • [43] Polynomial factorization of spectral bases
    Vykhovanets, VS
    AUTOMATION AND REMOTE CONTROL, 2004, 65 (12) : 1861 - 1871
  • [44] FACTORIZATION IN SUBALGEBRAS OF THE POLYNOMIAL ALGEBRA
    Malcolmson, Peter
    Okoh, Frank
    HOUSTON JOURNAL OF MATHEMATICS, 2009, 35 (04): : 991 - 1012
  • [45] Approximate polynomial decomposition
    Corless, RM
    Giesbrecht, MW
    Jeffrey, DJ
    Watt, SM
    ISSAC 99: PROCEEDINGS OF THE 1999 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 1999, : 213 - 219
  • [46] APPROXIMATE ROOTS OF A POLYNOMIAL
    MOH, TT
    JOURNAL FUR DIE REINE UND ANGEWANDTE MATHEMATIK, 1975, 278 (NOV28): : 301 - 306
  • [47] On the Complexity of Noncommutative Polynomial Factorization
    Arvind, V.
    Rattan, Gaurav
    Joglekar, Pushkar
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 38 - 49
  • [48] Closure Results for Polynomial Factorization
    Chou, Chi-Ning
    Kumar, Mrinal
    Solomon, Noam
    THEORY OF COMPUTING, 2019, 15
  • [49] On the acceleration of an algorithm for polynomial factorization
    Malyshev, A. N.
    DOKLADY MATHEMATICS, 2013, 88 (02) : 586 - 589
  • [50] On the acceleration of an algorithm for polynomial factorization
    A. N. Malyshev
    Doklady Mathematics, 2013, 88 : 586 - 589
12345