A modular method to compute the rational univariate representation of zero-dimensional ideals
Given an ideal \(I \subseteq K[x _1,\ldots,x _n]\), it is a difficult task to determine the set of zeros of \(I\), even if \(I\) is known to be zero-dimensional. An important tool for this is the use of Gröbner bases, which by the so-called shape lemma often have a form suitable for finding zeros. The authors propose a new method to find a rational univariate representation (RUR) for \(I\), as defined by \textit{F. Rouillier} [Appl. Algebra Eng. Commun. Comput. 9, No.~5, 433-461 (1999; Zbl 0932.12008)]. This is another ideal basis which has the form \[ \{f(u),g _1(u) x _1 - h _1(u),\ldots,g _n(u) x _n - h _n(u)\} \] with \(u \in K[x _1,\ldots,x _n]\) a ``separating element and \(f,g _i,h _i\) univariate polynomials. The advantage over a Gröbner basis is that an RUR often has smaller coefficients. The new method applies to the case where the ground field \(K\) is \(\mathbb Q\) and uses reduction modulo a prime and Hensel lifting.
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- The invertibility of rational univariate representations
- Solving zero-dimensional systems through the rational univariate representation
- Computing the primary decomposition of zero-dimensional ideals
- Computing primitive elements of extension fields
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- scientific article; zbMATH DE number 4132308 (Why is no real title available?)
- scientific article; zbMATH DE number 1263403 (Why is no real title available?)
- scientific article; zbMATH DE number 1057750 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 939802 (Why is no real title available?)
- Interpolating polynomials from their values
- On lucky primes
- P-adic reconstruction of rational numbers
- Solutions of systems of algebraic equations and linear maps on residue class rings
- Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- Usage of modular techniques for efficient computation of ideal operations
- Computing PUR of zero-dimensional ideals of breadth at most one
- An improvement of the rational representation for high-dimensional systems
- Stratification associated with local \(b\)-functions
- Computing and using minimal polynomials
- A new Gröbner basis conversion method based on stabilization techniques
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- On a method for finding the roots of an ideal
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- A unified approach to computing real and complex zeros of zero-dimensional ideals
- Modular Algorithms for Computing a Generating Set of the Syzygy Module
- Gröbner bases of symmetric ideals
- Ideals modulo a prime
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- The invertibility of rational univariate representations
- Decomposing the radicals of polynomial ideals by rational univariate representations
- Computer algebra for guaranteed accuracy. How does it help?
This page was built for publication: A modular method to compute the rational univariate representation of zero-dimensional ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808670)
