Abstract
This paper presents a novel means of computing the greatest common divisor (GCD) of two polynomials with real-valued coefficients that have been perturbed by noise. The method involves the QR-factorization of a near-to-Toeplitz matrix derived from the Sylvester matrix of the two polynomials. It turns out that the GCD to within a constant factor is contained in the last nonzero row of the upper triangular matrix R in the QR-factorization of the near-to-Toeplitz matrix. The QR-factorization is efficiently performed by an algorithm due to Chun et al. (1987). A condition number estimator due to Bischof (1990) and an algorithm for rank estimation due to Zarowski (1998) are employed to account for the effects of noise.
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.
