Finding exact minimal polynomial by approximations

From MaRDI portal
Publication:2959025

DOI10.1145/1577190.1577211zbMATH Open1356.65039arXiv0902.0828OpenAlexW2000161988WikidataQ130990562 ScholiaQ130990562MaRDI QIDQ2959025FDOQ2959025


Authors: Xiaolin Qin, Yong Feng, Jingwei Chen, Jingzhong Zhang Edit this on Wikidata


Publication date: 3 February 2017

Published in: Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

Abstract: We present a new algorithm for reconstructing an exact algebraic number from its approximate value 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 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 other methods, this method has the numerical computation advantage of high efficiency. The experimental results show that the method is more efficient than emph{identify} in emph{Maple} 11 for obtaining an exact algebraic number from its approximation. In this paper, we completely implement how to obtain exact results by numerical approximate computations.


Full work available at URL: https://arxiv.org/abs/0902.0828




Recommendations





Cited In (5)

Uses Software





This page was built for publication: Finding exact minimal polynomial by approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959025)