An ODE-based method for computing the approximate greatest common divisor of polynomials
Sign Up to like & getrecommendations! Published in 2018 at "Numerical Algorithms"
DOI: 10.1007/s11075-018-0569-0
Abstract: Computing the greatest common divisor of a set of polynomials is a problem which plays an important role in different fields, such as linear system, control, and network theory. In practice, the polynomials are obtained… read more here.
Keywords: greatest common; ode based; computing approximate; method ... See more keywords