Solving zero-dimensional systems through the rational univariate representation
From MaRDI portal
Publication:1293968
DOI10.1007/s002000050114zbMath0932.12008OpenAlexW2011693299MaRDI QIDQ1293968
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
Numerical computation of solutions to systems of equations (65H10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Computing PUR of zero-dimensional ideals of breadth at most one, An improvement of the rational representation for high-dimensional systems, Certification for polynomial systems via square subsystems, A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers, Complexity results for triangular sets, A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving, Moments and sums of squares for polynomial optimization and related problems, Real algebraic numbers and polynomial systems of small degree, Stable normal forms for polynomial system solving, Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials, Solving bivariate systems using rational univariate representations, Blind algebraic identification of communication channels: symbolic solution algorithms, On polynomial feedback Nash equilibria for two-player scalar differential games, Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis, Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\), Gröbner bases and wavelet design, Polynomial equation solving by lifting procedures for ramified fibers, Modular composition modulo triangular sets and applications, Real root finding for low rank linear matrices, Positive root isolation for poly-powers by exclusion and differentiation, Solving rank-constrained semidefinite programs in exact arithmetic, The first rational Chebyshev knots, Numerical roadmap of smooth bounded real algebraic surface, Exact symbolic-numeric computation of planar algebraic curves, Computing Chebyshev knot diagrams, On the determination of cusp points of 3-RPR parallel manipulators, \texttt{PTOPO}: computing the geometry and the topology of parametric curves, Involutions of polynomially parametrized surfaces, Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization, Genus 2 point counting over prime fields, On the topology of real algebraic plane curves, Fast arithmetics in Artin-Schreier towers over finite fields, Root isolation of zero-dimensional polynomial systems with linear univariate representation, A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface, Effective coefficient asymptotics of multivariate rational functions via semi-numerical algorithms for polynomial systems, Sparse FGLM algorithms, Determination of the limits for multivariate rational functions, Exact algorithms for the bottleneck Steiner tree problem, A generalization of Stickelberger's theorem, On the computation of matrices of traces and radicals of ideals, Parallel computation of real solving bivariate polynomial systems by zero-matching method, Design of Marx generators as a structured eigenvalue assignment, Bit-size estimates for triangular sets in positive dimension, Khovanskii-Rolle continuation for real solutions, Separating linear forms and rational univariate representations of bivariate systems, A generic position based method for real root isolation of zero-dimensional polynomial systems, Relaxed Hensel lifting of triangular sets, A Symbolic Computation Approach Towards the Asymptotic Stability Analysis of Differential Systems with Commensurate Delays, Fast computation of special resultants, From an approximate to an exact absolute polynomial factorization, Solving determinantal systems using homotopy techniques, Homotopy techniques for solving sparse column support determinantal polynomial systems, New nonarithmetic complex hyperbolic lattices. II, Real Schubert Calculus: Polynomial Systems and a Conjecture of Shapiro and Shapiro, Multilinear polynomial systems: root isolation and bit complexity, Algebraic analysis of stability and bifurcation of a self-assembling micelle system, Multiple point compression on elliptic curves, Pivoting in extended rings for computing approximate Gröbner bases, A quadratic clipping step with superquadratic convergence for bivariate polynomial systems, Certified non-conservative tests for the structural stability of discrete multidimensional systems, Complexity of solving parametric polynomial systems, Improved algorithms for computing determinants and resultants, Deterministic normal position transformation and its applications, Solving the equality-constrained minimization problem of polynomial functions, Improved explicit estimates on the number of solutions of equations over a finite field, On the computation of an arrangement of quadrics in 3D, On sign conditions over real multivariate polynomials, A parametric representation of totally mixed Nash equilibria, On the minimum of a positive polynomial over the standard simplex, Probabilistic algorithms for computing resolvent representations of regular differential ideals, Block-Krylov techniques in the context of sparse-FGLM algorithms, A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection, On types of degenerate critical points of real polynomial functions, Computing real solutions of fuzzy polynomial systems, Real Root Isolation of Regular Chains, Real Root Isolation of Polynomial Equations Based on Hybrid Computation, The Approach of Moments for Polynomial Equations, Representations of fundamental groups of 3-manifolds into \(\mathrm{PGL}(3,\mathbb C)\): exact computations in low complexity, Rational univariate reduction via toric resultants, Thirty years of polynomial system solving, and now?, A conflict-driven solving procedure for poly-power constraints, Computing and using minimal polynomials, Complete numerical isolation of real roots in zero-dimensional triangular systems, On the asymptotic and practical complexity of solving bivariate systems over the reals, Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one, A prolongation-projection algorithm for computing the finite real variety of an ideal, Semidefinite characterization and computation of zero-dimensional real radical ideals, Exact Algorithms for Linear Matrix Inequalities, Characterizations of solutions in geochemistry: existence, uniqueness, and precipitation diagram, HELP: a sparse error locator polynomial for BCH codes, Intersection theory in differential algebraic geometry: Generic intersections and the differential Chow form, Fast computation of a rational point of a variety over a finite field, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Bit complexity for computing one point in each connected component of a smooth real algebraic set, Computing critical points for invariant algebraic systems, Degröbnerization: a political manifesto, Effective algorithm for computing Noetherian operators of zero-dimensional ideals, Real solving for positive dimensional systems., Quantitative curve selection lemma, Solving parametric systems of polynomial equations over the reals through Hermite matrices, Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients, Complex Links and Hilbert–Samuel Multiplicities, Symbolic computation in hyperbolic programming, Chordal Networks of Polynomial Ideals, Subresultants and the Shape Lemma, The invertibility of rational univariate representations, p-adic algorithm for bivariate Gröbner bases, Elimination ideal and bivariate resultant over finite fields, Computing the intersection between a rational parametric curve and a rational parametric surface, An FGLM-like algorithm for computing the radical of a zero-dimensional ideal, Further perspectives on elimination, Counting solutions of a polynomial system locally and exactly, Segre-driven radicality testing, Spectral norm of a symmetric tensor and its computation, Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability, Volume of Representations and Birationality of Peripheral Holonomy, Finding at least one point in each connected component of a real algebraic set defined by a single equation, A Gröbner free alternative for polynomial system solving, Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping, Improved projection for cylindrical algebraic decomposition, On computing absolutely irreducible components of algebraic varieties with parameters, Complexity, exactness, and rationality in polynomial optimization, A proof of Hilbert's theorem on ternary quartic forms, Control analysis and design via randomised coordinate polynomial minimisation
Uses Software
