Abstract
Differential (Ore) type polynomials with approximate polynomial coefficients are introduced. These provide a useful representation of approximate differential operators with a strong algebraic structure, which has been used successfully in the exact, symbolic, setting. We then present an algorithm for the approximate Greatest Common Right Divisor (GCRD) of two approximate differential polynomials, which intuitively is the differential operator whose solutions are those common to the two inputs operators. More formally, given approximate differential polynomials f and g, we show how to find nearby polynomials f and g which have a non-trivial GCRD. Here nearby is under a suitably defined norm. The algorithm is a generalization of the SVD-based method of Corless et al. (1995) for the approximate GCD of regular polynomials. We work on an appropriately linearized differential Sylvester matrix, to which we apply a block SVD. The algorithm has been implemented in Maple and a demonstration of its robustness is 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.
