Abstract
An extended polynomial GCD algorithm using Hankel matrices is presented in this paper. Given f and g univariate polynomials over a field we construct from a Hankel matrix, a finite sequence of polynomials -called the Polynomial Hankel Sequence-such that the last element gives the greatest common divisor and the second to the last yields the polynomials of the extended-GCD equality: u · f + v · g = gcd( f, g).
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.
