Hiroshi Sekigawa
- D. Manocha and J. F. Canny. Multipolynomial resultant algorithms. J. Symbolic Computation, 15(2):99--122, 1993. Google Scholar
Digital Library
- K. Nagasaka. A study on Gröbner basis with inexact input. In Proc. 2009 Computer Algebra in Scientific Computing (CASC 2009), LNCS 5743, pages 247--258, 2009. Google ScholarDigital Library
- A. Terui and T. Sasaki. Approximate zero-points of real univariate polynomial with large error terms. J. Information Processing Society of Japan, 41(4):974--989, 2000.Google Scholar
Index Terms
- Solvability of bivariate polynomial systems under perturbation
Recommendations
Roots of Bivariate Polynomial Systems via Determinantal Representations
We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal representation is suitable ...
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
STOC '82: Proceedings of the fourteenth annual ACM symposium on Theory of computingGiven an arbitrary but fixed integer r ≥ 3. We show that testing r-variate polynomials with integer coefficients for irreducibility is m-reducible in polynomial time of the total degree and the largest coefficient length to testing bivariate polynomials ...
Root isolation for bivariate polynomial systems with local generic position method
ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computationA local generic position method is proposed to isolate the real roots of a bivariate polynomial system ∑={f(x,y),g(x,y)}. In this method, the roots of the system are represented as linear combinations of the roots of two univariate polynomial equations ...
Comments