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 条
  • [31] MULTIVARIATE POLYNOMIAL FACTORIZATION
    MUSSER, DR
    JOURNAL OF THE ACM, 1975, 22 (02) : 291 - 308
  • [32] NUMERICAL FACTORIZATION OF A POLYNOMIAL
    HOUSEHOLDER, AS
    STEWART, GW
    SIAM REVIEW, 1971, 13 (01) : 38 - +
  • [33] ELEMENTS OF FACTORIZATION THEORY FROM A POLYNOMIAL POINT OF VIEW
    FUHRMANN, PA
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1989, 135 : 148 - 178
  • [34] Equivalence of Polynomial Identity Testing and Polynomial Factorization
    Swastik Kopparty
    Shubhangi Saraf
    Amir Shpilka
    computational complexity, 2015, 24 : 295 - 331
  • [35] Incomplete factorization by local exact factorization (ILUE)
    Kraus, Johannes
    Lymbery, Maria
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2018, 145 : 50 - 61
  • [36] Equivalence of Polynomial Identity Testing and Polynomial Factorization
    Kopparty, Swastik
    Saraf, Shubhangi
    Shpilka, Amir
    COMPUTATIONAL COMPLEXITY, 2015, 24 (02) : 295 - 331
  • [37] From exact to approximate maximum common subgraph
    Marini, S
    Spagnuolo, M
    Falcidieno, B
    GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, PROCEEDINGS, 2005, 3434 : 263 - 272
  • [38] Dynamical transition of glasses: From exact to approximate
    Mari, Romain
    Kurchan, Jorge
    JOURNAL OF CHEMICAL PHYSICS, 2011, 135 (12):
  • [39] Approximate Polynomial GCD by Approximate Syzygies
    Daniel Lichtblau
    Mathematics in Computer Science, 2019, 13 : 517 - 532
  • [40] Approximate Polynomial GCD by Approximate Syzygies
    Lichtblau, Daniel
    MATHEMATICS IN COMPUTER SCIENCE, 2019, 13 (04) : 517 - 532
12345