Abstract
Based on an improved parameterized integer relation construction method, a complete algorithm is proposed for finding an exact minimal polynomial from its approximate root. It relies on a study of the error controlling for its approximation. We provide a sufficient condition on the precision of the approximation, depending only on the degree and the height of its minimal polynomial. Our result is superior to the existent error controlling on obtaining an exact rational or algebraic number from its approximation. Moreover, some applications are presented and compared with the subsistent methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.