Abstract
The determination of an approximate greatest common divisor (GCD) of two inexact polynomials f = f ( y ) and g = g ( y ) arises in several applications, including signal processing and control. This approximate GCD can be obtained by computing a structured low rank approximation S * ( f , g ) of the Sylvester resultant matrix S ( f , g ) . In this paper, the method of structured total least norm (STLN) is used to compute a low rank approximation of S ( f , g ) , and it is shown that important issues that have a considerable effect on the approximate GCD have not been considered. For example, the established works only yield one matrix S * ( f , g ) , and therefore one approximate GCD, but it is shown in this paper that a family of structured low rank approximations can be computed, each member of which yields a different approximate GCD. Examples that illustrate the importance of these and other issues are presented.
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.
