Separating linear forms and rational univariate representations of bivariate systems
From MaRDI portal
Publication:480646
DOI10.1016/J.JSC.2014.08.009zbMATH Open1328.13041OpenAlexW2072205301MaRDI QIDQ480646FDOQ480646
Authors: Yacine Bouzidi, Sylvain Lazard, Marc Pouget, Fabrice Rouillier 
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
Recommendations
- Rational univariate representations of bivariate systems and applications
- Solving bivariate systems using rational univariate representations
- Separating linear forms for bivariate systems
- Improved algorithm for computing separating linear forms for bivariate systems
- On the complexity of real solving bivariate systems
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Cites Work
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Root isolation for bivariate polynomial systems with local generic position method
- Fast modular transforms
- Algorithms in real algebraic geometry
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Solving zero-dimensional systems through the rational univariate representation
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sharp estimates for triangular sets
- On the complexity of solving a bivariate polynomial system
- A Gröbner free alternative for polynomial system solving
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sylvester-Habicht sequences and fast Cauchy index computation
- From approximate factorization to root isolation
- An elementary approach to subresultants theory.
- Fast algorithms for zero-dimensional polynomial systems using duality
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- On the topology of real algebraic plane curves
- Efficient topology determination of implicitly defined algebraic plane curves.
- When Newton meets Descartes
- A worst-case bound for topology computation of algebraic curves
- On the computation of the topology of a non-reduced implicit space curve
- Polynomial Minimum Root Separation
- Solving zero-dimensional algebraic systems
- Practical divide-and-conquer algorithms for polynomial arithmetic
- Title not available (Why is that?)
- FAST SOFTWARE FOR BOX INTERSECTIONS
- Real root isolation of regular chains
- Univariate real root isolation in an extension field
- Title not available (Why is that?)
- Computer Algebra in Scientific Computing
Cited In (12)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- Title not available (Why is that?)
- Solving bivariate systems using rational univariate representations
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays
- Title not available (Why is that?)
- Univariate real root isolation in an extension field and applications
- On Isolating Roots in a Multiple Field Extension
- Bivariate triangular decompositions in the presence of asymptotes
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- An improved complexity bound for computing the topology of a real algebraic space curve
Uses Software
This page was built for publication: Separating linear forms and rational univariate representations of bivariate systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480646)
