43 citations · 137 across the 39 of their papers we have counts for
Showing math.NAShow all
3 papers · 1 filter
math.NA2002★ 43 cited
High Probability Analysis of the Condition Number of Sparse Polynomial Systems
Gregorio Malajovich, J. Maurice Rojas
Let F:=(f_1,...,f_n) be a random polynomial system with fixed n-tuple of supports. Our main result is an upper bound on the probability that the condition number of f in a region U…
math.NA2001★ 1 cited
On Solving Fewnomials Over Intervals in Fewnomial Time
J. Maurice Rojas, Yinyu Ye
Let f be a degree D univariate polynomial with real coefficients and exactly m monomial terms. We show that in the special case m=3 we can approximate within eps all the roots of f…
math.NA2000★ 5 cited
Random Sparse Polynomial Systems
Gregorio Malajovich, J. Maurice Rojas
Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian…