2010/01/05 by Xiaolin Qin, Qin, Xiaolin, Yong Feng +5
Computer Science · #F.2.1 #FOS: Computer and information sciences #I.1.2 #Symbolic Computation (cs.SC) #cs.SC
paper · pdf · doi:10.48550/arxiv.1001.0649
17
arxiv created 2010/01/05 · arxiv updated 2010/01/14
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to 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. we also discuss some applications to some transcendental numbers by approximations. 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.