Finding exact minimal polynomial by approximations

  • Authors:

  • Xiaolin Qin;Yong Feng;Jingwei Chen;Jingzhong Zhang

  • Affiliations:

  • Chinese Academy of Sciences, Chengdu, China;Chinese Academy of Sciences and University of Electronic Science and Technology of China, Chengdu, China;Chinese Academy of Sciences, Chengdu, China;Chinese Academy of Sciences and University of Electronic Science and Technology of China, Chengdu, China

  • Venue:
  • Proceedings of the 2009 conference on Symbolic numeric computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new algorithm for reconstructing an exact algebraic number from its approximate value by using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on obtaining an exact rational number from its approximation. The algorithm is applicable for finding exact minimal polynomial of an algebraic number by its approximate root. This also enables us to provide an efficient method of converting the rational approximation representation to the minimal polynomial representation, and devise a simple algorithm to factor multivariate polynomials with rational coefficients. Compared with the subsistent methods, our method combines advantage of high efficiency in numerical computation, and exact, stable results in symbolic computation. The experimental results show that the method is more efficient than identify in Maple for obtaining an exact algebraic number from its approximation. Moreover, the Digits of our algorithm is far less than the LLL-lattice basis reduction technique in theory. In this paper, we completely implement how to obtain exact results by numerical approximate computations.