Solving bivariate systems using rational univariate representations
From MaRDI portal
Recommendations
- Rational univariate representations of bivariate systems and applications
- Solving zero-dimensional systems through the rational univariate representation
- Separating linear forms and rational univariate representations of bivariate systems
- On solving systems of bivariate polynomials
- Computer Algebra in Scientific Computing
- Computation of the rational representation for solutions of high-dimensional systems
- Rational univariate representation and its application in optimization problem
- On the complexity of real solving bivariate systems
- Solvability of bivariate polynomial systems under perturbation
- On the complexity of solving bivariate systems
Cites work
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A simple but exact and efficient algorithm for complex root isolation
- Algorithms in real algebraic geometry
- An elementary approach to subresultants theory.
- An improved upper complexity bound for the topology computation of a real algebraic plane curve
- Computing real roots of real polynomials
- Fast algorithms for zero-dimensional polynomial systems using duality
- Fast modular transforms
- From approximate factorization to root isolation with application to cylindrical algebraic decomposition
- Improved algorithm for computing separating linear forms for bivariate systems
- Modern computer algebra
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of computing with planar algebraic curves
- PRIMES is in P
- Root refinement for real polynomials using quadratic interval refinement
- Separating linear forms and rational univariate representations of bivariate systems
- Solving zero-dimensional systems through the rational univariate representation
- Sylvester-Habicht sequences and fast Cauchy index computation
- The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Using Algebraic Geometry
Cited in
(26)- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- Certified numerical algorithm for isolating the singularities of the plane projection of generic smooth space curves
- An \(\mathfrak{m}\)-adic algorithm for bivariate Gröbner bases
- Computing the non-properness set of real polynomial maps in the plane
- Bounds for polynomials on algebraic numbers and application to curve topology
- Improved algorithm for computing separating linear forms for bivariate systems
- Certified numerical real root isolation for bivariate nonlinear systems
- An algebraic framework for computing the topology of offsets to rational curves
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- An improved complexity bound for computing the topology of a real algebraic space curve
- On the complexity of computing the topology of real algebraic space curves
- On the bit complexity of polynomial system solving
- The complexity of subdivision for diameter-distance tests
- Computing the topology of a plane or space hyperelliptic curve
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- Rational univariate reduction via toric resultants
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- p-adic algorithm for bivariate Gröbner bases
- Bivariate triangular decompositions in the presence of asymptotes
- Separating linear forms and rational univariate representations of bivariate systems
- Rational univariate representations of bivariate systems and applications
- Separating linear forms for bivariate systems
- Fast computation of generic bivariate resultants
This page was built for publication: Solving bivariate systems using rational univariate representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325154)
