Abstract
A machine computation of the greatest common divisor of two polynomials is a ticklish affair, due to a possibly severe propagation of rounding errors in the successive divisions. Usually a remainder will be put equal to zero if its coefficients are smaller than a certain quantity, which one has generally no idea of how to choose conveniently. It is shown that this vague criterion for neglecting coefficients can be made more precise and depending on each remainder.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
