Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Root clustering"”.

  1. Hybrid Symbolic-Numeric Computing in Linear and Polynomial Algebra

    … thesis. In Chapter 2, we adapt Victor Y. Pan's root-based algorithm for finding approximate GCD to the case where the polynomials are expressed in Bernstein bases. We use the numerically stable companion pencil of G. F. Jónsson to compute the roots, and the Hopcroft-Karp bipartite matching …

    uwo Repository record for Hybrid Symbolic-Numeric Computing in Linear and Polynomial Algebra (opens in a new tab)