1 citations · 3 across the 7 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2021★ 1 cited
The D-plus Discriminant and Complexity of Root Clustering
Jing Yang, Chee K. Yap
Let be an integer polynomial with distinct roots whose multiplicities are . We define the D-plus discriminant of $p(…
cs.SC2021
Complexity Analysis of Root Clustering for a Complex Polynomial
Ruben Becker, Michael Sagraloff, Vikram Sharma +2
Let be an arbitrary complex polynomial. We introduce the local root clustering problem, to compute a set of natural -clusters of roots of in some box reg…
cs.SC2020
On mu-Symmetric Polynomials
Jing Yang, Chee K. Yap
In this paper, we study functions of the roots of a univariate polynomial in which the roots have a given multiplicity structure . Traditionally, root functions are studied via…