Abstract

The obvious approach to computing the common factor (i.e., greatest common divisor (GCD)) between polynomials over a real number field is to employ Euclid's algorithm. However, this algorithm is not robust if the polynomial coefficients are perturbed by noise. Here we see that GCD computation is equivalent to QR-factorizing a rank deficient near-to-Toeplitz matrix derived from the Sylvester matrix of the polynomials. Given noisy data the matrix is only nearly rank deficient. We summarize a computationally efficient and numerically reliable algorithm for QR-factorizing the nearly rank deficient matrix.

Full Text
Paper version not known

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 call

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.