Counting solutions of a polynomial system locally and exactly

DOI10.1016/j.jsc.2023.102222arXiv1712.05487OpenAlexW2774293199MaRDI QIDQ6170809

Ruben Becker, Michael Sagraloff

Publication date: 10 August 2023

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.05487

zbMATH Keywords

elimination methodscomplexity analysispolynomial system solvingbivariate systemscertified computationarithmetic Nullstellensatz

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

Isolating clusters of zeros of analytic systems using arbitrary-degree inflation ⋮ On Isolating Roots in a Multiple Field Extension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact symbolic-numeric computation of planar algebraic curves
• Certifying solutions to square systems of polynomial-exponential equations
• A general approach to the analysis of controlled perturbation algorithms
• Thirty years of polynomial system solving, and now?
• Subdivision methods for solving polynomial equations
• Solving zero-dimensional systems through the rational univariate representation
• Homotopies for solving polynomial systems within a bounded domain
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Computing multiple zeros of polynomial systems: case of breadth one (invited talk)
• Improved algorithms for computing determinants and resultants
• From approximate factorization to root isolation with application to cylindrical algebraic decomposition
• On the complexity of computing with planar algebraic curves
• The shifted number system for fast linear algebra on integer matrices
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Heights of varieties in multiprojective spaces and arithmetic Nullstellensatze
• The DMM bound
• Complexity Analysis of Root Clustering for a Complex Polynomial
• On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
• On Analytic Differential Equations
• Algorithm 795
• Using Algebraic Geometry
• Complete subdivision algorithms, II

This page was built for publication: Counting solutions of a polynomial system locally and exactly