Usage of modular techniques for efficient computation of ideal operations
Modular techniques are a powerful tool in computer algebra to improve the performance of the computations over the field of rationals to avoid the growth of intermediate coefficients. The main idea is to choose some lucky prime numbers, performing the computation modulo these primes and then reconstruct the the desired object by using the Chinese remainder theorem. In [J. Symb. Comput. 35, No. 4, 403--419 (2003; Zbl 1046.13018)], \textit{E. A. Arnold} proposed an approach to test the luckiness of a given prime. For example, she defined a Hilbert lucky prime: A prime number \(p\) is called Hilbert lucky prime for an ideal if, modulo \(p\), the Hilbert function of the ideal is preserved. In the paper under review, the authors discuss different notions of a lucky prime which have been already proposed in the literature and define also a new notion of an affine Hilbert lucky prime. In addition, they apply the modular techniques for the computation of Gröbner bases, and some ideal operations.
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- A new efficient algorithm for computing Gröbner bases (F₄)
- A p-adic approach to the computation of Gröbner bases
- An approach to solving systems of polynomials via modular arithmetics with applications
- Bit-size estimates for triangular sets in positive dimension
- Efficient arithmetic in successive algebraic extension fields using symmetries
- Gröbner bases of symmetric ideals
- Hilbert functions and the Buchberger algorithm
- scientific article; zbMATH DE number 1726532 (Why is no real title available?)
- scientific article; zbMATH DE number 5509903 (Why is no real title available?)
- scientific article; zbMATH DE number 62658 (Why is no real title available?)
- scientific article; zbMATH DE number 1302473 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Lifting techniques for triangular decompositions
- Linearizability of linear systems perturbed by fifth degree homogeneous polynomials
- Modern computer algebra
- Modular Algorithms for Computing a Generating Set of the Syzygy Module
- Modular algorithms for computing Gröbner bases.
- Multi-modular algorithm for computing the splitting field of a polynomial
- On lucky ideals for Gröbner basis computations
- On lucky primes
- Parallelization of modular algorithms
- Sharp estimates for triangular sets
- Solving via modular methods
- The use of bad primes in rational reconstruction
- Verification of Gröbner basis candidates
- Modular techniques for noncommutative Gröbner bases
- Computing and using minimal polynomials
- Ideals modulo a prime
- Modular techniques for effective localization and double ideal quotient
- A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
- Modular computations of standard bases for subalgebras
This page was built for publication: Usage of modular techniques for efficient computation of ideal operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993362)
