Separating linear forms and rational univariate representations of bivariate systems
type: Item
instance of: scholarly article
title: Separating linear forms and rational univariate representations of bivariate systems
zbMATH Open document ID: 1328.13041
author: Yacine Bouzidi
author: Sylvain Lazard
author: Marc Pouget
author: Fabrice Rouillier
published in: Journal of Symbolic Computation
publication date: 2014-12-09T00:00:00Z
Mathematics Subject Classification ID: 13P15
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 6378425
zbMATH Keywords: bivariate system
zbMATH Keywords: separating linear form
zbMATH Keywords: rational univariate representation
describes a project that uses: ISOLATE
describes a project that uses: Kronecker
describes a project that uses: Lgp
describes a project that uses: modpn
MaRDI profile type: Publication
full work available at URL: j.jsc.2014.08.009
OpenAlex ID: W2072205301
cites work: Algorithms in real algebraic geometry
cites work: Fast algorithms for zero-dimensional polynomial systems using duality
cites work: Q5188226
cites work: Computer Algebra in Scientific Computing
cites work: On the topology of real algebraic plane curves
cites work: Root isolation for bivariate polynomial systems with local generic position method
cites work: Q5301656
cites work: Sharp estimates for triangular sets
cites work: On the computation of the topology of a non-reduced implicit space curve
cites work: On the asymptotic and practical complexity of solving bivariate systems over the reals
cites work: An elementary approach to subresultants theory.
cites work: On the complexity of solving a bivariate polynomial system
cites work: A Gröbner free alternative for polynomial system solving
cites work: An improved upper complexity bound for the topology computation of a real algebraic plane curve
cites work: Efficient topology determination of implicitly defined algebraic plane curves.
cites work: Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
cites work: A worst-case bound for topology computation of algebraic curves
cites work: Q3325833
cites work: Solving zero-dimensional algebraic systems
cites work: The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
cites work: Sylvester-Habicht sequences and fast Cauchy index computation
cites work: From approximate factorization to root isolation
cites work: Fast modular transforms
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Q4226968
cites work: Solving zero-dimensional systems through the rational univariate representation
cites work: Q4341368
cites work: Polynomial Minimum Root Separation
cites work: When Newton meets Descartes
cites work: Univariate real root isolation in an extension field
cites work: Q4406533
cites work: Q4953977
cites work: FAST SOFTWARE FOR BOX INTERSECTIONS
DOI: 10.1016/J.JSC.2014.08.009
description: scientific article; zbMATH DE number 6378425