Abstract
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. The first part of this book reviews the main resul
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have