Solving zero-dimensional systems through the rational univariate representation
From MaRDI portal
Publication:1293968
Recommendations
Cited in
(only showing first 100 items - show all)- Computing PUR of zero-dimensional ideals of breadth at most one
- Chordal networks of polynomial ideals
- Degröbnerization: a political manifesto
- The invertibility of rational univariate representations
- Subresultants and the Shape Lemma
- Certified non-conservative tests for the structural stability of discrete multidimensional systems
- Symbolic computation in hyperbolic programming
- Deterministic normal position transformation and its applications
- Quantitative curve selection lemma
- Solving parametric systems of polynomial equations over the reals through Hermite matrices
- Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems
- Computing critical points for invariant algebraic systems
- Computing real solutions of fuzzy polynomial systems
- HELP: a sparse error locator polynomial for BCH codes
- Involutions of polynomially parametrized surfaces
- A proof of Hilbert's theorem on ternary quartic forms
- Intersection theory in differential algebraic geometry: generic intersections and the differential Chow form
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
- Multilinear polynomial systems: root isolation and bit complexity
- Real root finding for low rank linear matrices
- Numerical roadmap of smooth bounded real algebraic surface
- An improvement of the rational representation for high-dimensional systems
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- Homotopy techniques for solving sparse column support determinantal polynomial systems
- New nonarithmetic complex hyperbolic lattices. II
- Blind algebraic identification of communication channels: symbolic solution algorithms
- Exact algorithms for linear matrix inequalities
- Solving determinantal systems using homotopy techniques
- The approach of moments for polynomial equations
- An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
- Computing and using minimal polynomials
- Fast computation of a rational point of a variety over a finite field
- \texttt{PTOPO}: computing the geometry and the topology of parametric curves
- Rational univariate reduction via toric resultants
- Determination of the limits for multivariate rational functions
- Spectral norm of a symmetric tensor and its computation
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Algebraic analysis of stability and bifurcation of a self-assembling micelle system
- Bit complexity for computing one point in each connected component of a smooth real algebraic set
- Volume of representations and birationality of peripheral holonomy
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization
- 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
- Solving rank-constrained semidefinite programs in exact arithmetic
- Parallel computation of real solving bivariate polynomial systems by zero-matching method
- Design of Marx generators as a structured eigenvalue assignment
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
- On polynomial feedback Nash equilibria for two-player scalar differential games
- Genus 2 point counting over prime fields
- Improved explicit estimates on the number of solutions of equations over a finite field
- On the computation of matrices of traces and radicals of ideals
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Khovanskii-Rolle continuation for real solutions
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity
- Motivations for an arbitrary precision interval arithmetic and the MPFI library
- Real algebraic numbers and polynomial systems of small degree
- Kronecker's and Newton's approaches to solving: a first comparison
- Stable normal forms for polynomial system solving
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Thirty years of polynomial system solving, and now?
- Fast arithmetics in Artin-Schreier towers over finite fields
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Improved algorithms for computing determinants and resultants
- Computation of the rational representation for solutions of high-dimensional systems
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- On the determination of cusp points of 3-RPR parallel manipulators
- Gröbner bases and wavelet design
- On the topology of real algebraic plane curves
- Complexity results for triangular sets
- Moments and sums of squares for polynomial optimization and related problems
- Complete numerical isolation of real roots in zero-dimensional triangular systems
- Improved projection for cylindrical algebraic decomposition
- On the minimum of a positive polynomial over the standard simplex
- Solving bivariate systems using rational univariate representations
- Probabilistic algorithms for computing resolvent representations of regular differential ideals
- A concise proof of the Kronecker polynomial system solver from scratch
- The first rational Chebyshev knots
- Sparse FGLM algorithms
- From an approximate to an exact absolute polynomial factorization
- Real solving for positive dimensional systems.
- Exact symbolic-numeric computation of planar algebraic curves
- scientific article; zbMATH DE number 1952043 (Why is no real title available?)
- Pivoting in extended rings for computing approximate Gröbner bases
- On sign conditions over real multivariate polynomials
- Complexity of solving parametric polynomial systems
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- Computing Chebyshev knot diagrams
- Multiple point compression on elliptic curves
- A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface
- Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro
- Solving zero-dimensional algebraic systems
- A generalization of Stickelberger's theorem
- A Gröbner free alternative for polynomial system solving
- Solving the equality-constrained minimization problem of polynomial functions
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)
