Separating linear forms and rational univariate representations of bivariate systems
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 1253989 (Why is no real title available?)
- scientific article; zbMATH DE number 1023365 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 5494027 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A worst-case bound for topology computation of algebraic curves
- 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
- Computer Algebra in Scientific Computing
- Efficient topology determination of implicitly defined algebraic plane curves.
- FAST SOFTWARE FOR BOX INTERSECTIONS
- Fast algorithms for zero-dimensional polynomial systems using duality
- Fast modular transforms
- From approximate factorization to root isolation
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- On the complexity of solving a bivariate polynomial system
- On the computation of the topology of a non-reduced implicit space curve
- On the topology of real algebraic plane curves
- Polynomial Minimum Root Separation
- Practical divide-and-conquer algorithms for polynomial arithmetic
- Real root isolation of regular chains
- Root isolation for bivariate polynomial systems with local generic position method
- Sharp estimates for triangular sets
- Solving zero-dimensional algebraic 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
- Univariate real root isolation in an extension field
- When Newton meets Descartes
Cited in
(15)- Univariate real root isolation in an extension field and applications
- A symbolic computation approach towards the asymptotic stability analysis of differential systems with commensurate delays
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- Improved algorithm for computing separating linear forms for bivariate systems
- scientific article; zbMATH DE number 1066345 (Why is no real title available?)
- Solving bivariate systems using rational univariate representations
- An improved complexity bound for computing the topology of a real algebraic space curve
- scientific article; zbMATH DE number 6154261 (Why is no real title available?)
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- Bivariate triangular decompositions in the presence of asymptotes
- Rational univariate representations of bivariate systems and applications
- Separating linear forms for bivariate systems
- On Isolating Roots in a Multiple Field Extension
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)
