arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.0649cs.SC
收藏

用近似法求精确极小多项式的一个完整算法

A complete algorithm to find exact minimal polynomial by approximations

Xiaolin Qin, Yong Feng, Jingwei Chen, Jingzhong Zhang

摘要:

利用一种改进的参数化整数关系构造方法,给出了由近似值求精确极小多项式的完整算法。我们的结果是优于存在的误差控制,获得一个确切的有理数从它的近似。该算法适用于由代数数的近似根求代数数的精确极小多项式。这也使我们能够提供一个有效的方法转换的有理逼近表示的最小多项式表示,并设计一个简单的算法,因子与有理系数的多元多项式。与现有方法相比,该方法既具有数值计算效率高的优点,又具有符号计算结果准确、稳定的优点。本文还讨论了逼近在某些超越数上的应用。此外,我们的算法的数字是远远小于LLL-格基减少技术在理论上。在本文中,我们完全实现了如何通过数值近似计算获得精确的结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑