Bivariate triangular decompositions in the presence of asymptotes
From MaRDI portal
Publication:512372
DOI10.1016/J.JSC.2017.01.004zbMATH Open1357.13031OpenAlexW2475226043MaRDI QIDQ512372FDOQ512372
Authors: Sylvain Lazard, Marc Pouget, Fabrice Rouillier 
Publication date: 24 February 2017
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01468796/file/JSC.pdf
Recommendations
- Multiplicity-preserving triangular set decomposition of two polynomials
- Irredundant triangular decomposition
- Algorithms for computing triangular decompositions of polynomial systems
- Complexity of triangular representations of algebraic sets
- On the asymptotic and practical complexity of solving bivariate systems over the reals
Cites Work
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- On the exact computation of the topology of real algebraic curves
- Using Algebraic Geometry
- Algorithms in real algebraic geometry
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Solving bivariate systems using rational univariate representations
- Title not available (Why is that?)
- Sylvester-Habicht sequences and fast Cauchy index computation
- Modern computer algebra
- An elementary approach to subresultants theory.
- Separating linear forms and rational univariate representations of bivariate systems
- Computing differential characteristic sets by change of ordering
Cited In (3)
Uses Software
This page was built for publication: Bivariate triangular decompositions in the presence of asymptotes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512372)
