Search Results - "Numerical Algorithms and Problems—computations on polynomials"

  • Showing 1 - 1 results of 1
Refine Results
  1. 1

    Division-free computation of subresultants using Bezout matrices by Kerber, Michael

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Taylor & Francis 01.12.2009
    “…We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm…”
    Get full text
    Journal Article