Separating linear forms and rational univariate representations of bivariate systems
From MaRDI portal
Publication:480646
DOI10.1016/j.jsc.2014.08.009zbMath1328.13041OpenAlexW2072205301MaRDI QIDQ480646
Fabrice Rouillier, Marc Pouget, Yacine Bouzidi, Sylvain Lazard
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.08.009
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items
Solving bivariate systems using rational univariate representations, \texttt{PTOPO}: computing the geometry and the topology of parametric curves, On Isolating Roots in a Multiple Field Extension, Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems, A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays, Bivariate triangular decompositions in the presence of asymptotes, Univariate real root isolation in an extension field and applications, Certified non-conservative tests for the structural stability of discrete multidimensional systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- On the topology of real algebraic plane curves
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- A worst-case bound for topology computation of algebraic curves
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Solving zero-dimensional algebraic systems
- Fast modular transforms
- Solving zero-dimensional systems through the rational univariate representation
- An elementary approach to subresultants theory.
- Fast algorithms for zero-dimensional polynomial systems using duality
- Efficient topology determination of implicitly defined algebraic plane curves.
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Root isolation for bivariate polynomial systems with local generic position method
- From approximate factorization to root isolation
- Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
- Polynomial Minimum Root Separation
- Sharp estimates for triangular sets
- FAST SOFTWARE FOR BOX INTERSECTIONS
- On the complexity of solving a bivariate polynomial system
- When Newton meets Descartes
- Univariate real root isolation in an extension field
- On the computation of the topology of a non-reduced implicit space curve
- Computer Algebra in Scientific Computing
- Algorithms in real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
- A Gröbner free alternative for polynomial system solving
