1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.SC2015
Extractions: Computable and Visible Analogues of Localizations for Polynomial Ideals
Ye Liang
When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a…
cs.SC2014★ 1 cited
Solving Polynomial Equations with Equation Constraints: the Zero-dimensional Case
Ye Liang
A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal , we study its comp…
math.NA2012★ 1 cited
Real root refinements for univariate polynomial equations
Ye Liang
Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose t…