A modular method to compute the rational univariate representation of zero-dimensional ideals
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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
- 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
Cited in
(20)- A unified approach to computing real and complex zeros of zero-dimensional ideals
- Usage of modular techniques for efficient computation of ideal operations
- Computing and using minimal polynomials
- Gröbner bases of symmetric ideals
- Computer algebra for guaranteed accuracy. How does it help?
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
- A simplified rational representation for positive-dimensional polynomial systems and SHEPWM equations solving
- Computing PUR of zero-dimensional ideals of breadth at most one
- A new Gröbner basis conversion method based on stabilization techniques
- Decomposing the radicals of polynomial ideals by rational univariate representations
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Ideals modulo a prime
- Root isolation of zero-dimensional polynomial systems with linear univariate representation
- Stratification associated with local \(b\)-functions
- Modular Algorithms for Computing a Generating Set of the Syzygy Module
- The invertibility of rational univariate representations
- Separating element computation for the rational univariate representation with short coefficients in zero-dimensional algebraic varieties
- Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem
- An improvement of the rational representation for high-dimensional systems
- On a method for finding the roots of an ideal
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)
