On solving systems of bivariate polynomials

11Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Solving systems of bivariate polynomials is a critical operation: curves plotting, curves topology, parametric systems, general solvers which are recursive on the number of variables, etc. Several strategies currently exist from numerical algorithms (bisections for example, interval arithmetic) to general rewriting methods (Gröbner bases, triangular sets, resultants, etc.) with advantages and drawbacks. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Rouillier, F. (2010). On solving systems of bivariate polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 100–104). https://doi.org/10.1007/978-3-642-15582-6_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free