REVIEW 6 cited by
Reading Rational Univariate Representations on lexicographic Groebner bases
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of certifying a separating linear form and, once certified, calculating the RUR that comes from it, without any condition on the ideal else than being zero-dimensional. Our key result is that the RUR can be read (closed formula) from lexicographic Groebner bases of bivariate elimination ideals, even in the case where the original ideal that is not in shape position, so that one can use the same core as the well known FGLM method to propose a simple algorithm. Our first experiments, either with a very short code (300 lines) written in Maple or with a Julia code using straightforward implementations performing only classical Gaussian reductions in addition to Groebner bases for the degree reverse lexicographic ordering, show that this new method is already competitive with sophisticated state of the art implementations which do not certify the parameterizations.
Forward citations
Cited by 6 Pith papers
-
Solving bihomogeneous polynomial systems with a zero-dimensional projection
For bihomogeneous polynomial systems with a finite projection, new multiplication maps built from an admissible bidegree recover the projection and its Gröbner basis via a generalized FGLM.
-
Groebner.jl: Fast Gr\"obner Tracing in Julia
Groebner.jl ships a reusable learn/apply interface for Traverso tracing inside F4, with product-ring SIMD batching that yields 1.5–6.6× speedups on multi-modular Gröbner tasks in Julia.
-
Some Computational Tools for Solving a Selection of Problems in Control Theory
PACE.jl is a new Julia package applying certified symbolic-numeric algorithms to parameter identification, structural stability analysis, and H-infinity norm computation in control systems.
-
Fast Rational Univariate Representation via Gaussian Elimination
Dense Gaussian elimination yields a practical, certified Julia solver for rational univariate representations of zero-dimensional ideals with thousands of solutions in seconds.
-
Symbolic and Numerical Tools for $L_{\infty}$-Norm Calculation
Symbolic methods compute L-infinity norms exactly but slowly, and they outperform numerical methods on ill-conditioned or parameterized systems.
-
Parameter Estimation in ODE Models with Certified Polynomial System Solving
A certified algebraic solver based on rational univariate representations outperforms homotopy continuation on some parameter estimation problems for ODE models, while homotopy continuation remains better on systems w...
Discussion (0). Continue with ORCID to comment.