Solving zero-dimensional systems through the rational univariate representation
From MaRDI portal
Publication:1293968
DOI10.1007/S002000050114zbMATH Open0932.12008OpenAlexW2011693299MaRDI QIDQ1293968FDOQ1293968
Authors: Fabrice Rouillier 
Publication date: 27 February 2000
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002000050114
Recommendations
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical computation of solutions to systems of equations (65H10)
Cited In (only showing first 100 items - show all)
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
- Solving determinantal systems using homotopy techniques
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Symbolic computation in hyperbolic programming
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- Multilinear polynomial systems: root isolation and bit complexity
- Computing and using minimal polynomials
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Deterministic normal position transformation and its applications
- Quantitative curve selection lemma
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- Solving rank-constrained semidefinite programs in exact arithmetic
- Computing PUR of zero-dimensional ideals of breadth at most one
- Blind algebraic identification of communication channels: symbolic solution algorithms
- Determination of the limits for multivariate rational functions
- Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- Computing critical points for invariant algebraic systems
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Fast computation of a rational point of a variety over a finite field
- Rational univariate reduction via toric resultants
- Computing real solutions of fuzzy polynomial systems
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- On types of degenerate critical points of real polynomial functions
- HELP: a sparse error locator polynomial for BCH codes
- Subresultants and the Shape Lemma
- Numerical roadmap of smooth bounded real algebraic surface
- Exact algorithms for linear matrix inequalities
- The approach of moments for polynomial equations
- A proof of Hilbert's theorem on ternary quartic forms
- The invertibility of rational univariate representations
- Real root finding for low rank linear matrices
- Degröbnerization: a political manifesto
- Algebraic analysis of stability and bifurcation of a self-assembling micelle system
- Involutions of polynomially parametrized surfaces
- An improvement of the rational representation for high-dimensional systems
- Spectral norm of a symmetric tensor and its computation
- Volume of representations and birationality of peripheral holonomy
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- New nonarithmetic complex hyperbolic lattices. II
- Chordal networks of polynomial ideals
- A parametric representation of totally mixed Nash equilibria
- A concise proof of the Kronecker polynomial system solver from scratch
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- Sparse FGLM algorithms
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Real root isolation of regular chains
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- Complexity results for triangular sets
- Solving bivariate systems using rational univariate representations
- p-adic algorithm for bivariate Gröbner bases
- Modular composition modulo triangular sets and applications
- Genus 2 point counting over prime fields
- Fast arithmetics in Artin-Schreier towers over finite fields
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Bit-size estimates for triangular sets in positive dimension
- A Gröbner free alternative for polynomial system solving
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation
- Polynomial equation solving by lifting procedures for ramified fibers
- Kronecker's and Newton's approaches to solving: a first comparison
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Improved projection for cylindrical algebraic decomposition
- The first rational Chebyshev knots
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
- On computing absolutely irreducible components of algebraic varieties with parameters
- Improved explicit estimates on the number of solutions of equations over a finite field
- On the determination of cusp points of 3-RPR parallel manipulators
- Complexity of solving parametric polynomial systems
- A generalization of Stickelberger's theorem
- Khovanskii-Rolle continuation for real solutions
- Title not available (Why is that?)
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- Separating linear forms and rational univariate representations of bivariate systems
- Design of Marx generators as a structured eigenvalue assignment
- Real algebraic numbers and polynomial systems of small degree
- Solving the equality-constrained minimization problem of polynomial functions
- On the computation of an arrangement of quadrics in 3D
- Improved algorithms for computing determinants and resultants
- Real solving for positive dimensional systems.
- On sign conditions over real multivariate polynomials
- A generic position based method for real root isolation of zero-dimensional polynomial systems
- Relaxed Hensel lifting of triangular sets
- Moments and sums of squares for polynomial optimization and related problems
- On polynomial feedback Nash equilibria for two-player scalar differential games
- Gröbner bases and wavelet design
- Title not available (Why is that?)
Uses Software
This page was built for publication: Solving zero-dimensional systems through the rational univariate representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293968)
