Computer Science – Symbolic Computation
Scientific paper
2010-01-05
Computer Science
Symbolic Computation
17
Scientific paper
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.
Chen Jingwei
Feng Yong
Qin Xiaolin
Zhang Jingzhong
No associations
LandOfFree
A complete algorithm to find exact minimal polynomial by approximations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A complete algorithm to find exact minimal polynomial by approximations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A complete algorithm to find exact minimal polynomial by approximations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-539995