Masaru Sanuki

Learn More
Given polynomials with floating-point number coefficients, one can now compute the approximate GCD stably, except in ill-conditioned cases where the GCD has small or large leading coefficient/constant term. The cost is <i>O</i>(<i>m</i><sup>2</sup>), where <i>m</i> is the maximum of degrees of given polynomials. On the other hand, for polynomial with(More)
  • 1