Computing and using minimal polynomials
DOI10.1016/j.jsc.2019.07.022zbMath1468.13063arXiv1702.07262OpenAlexW2965416181MaRDI QIDQ2307625
Anna Maria Bigatti, John Abbott, Lorenzo Robbiano, Elisa Palezzato
Publication date: 24 March 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07262
Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic surfaces (14Q10) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Twin-float arithmetic
- Implicitization of hypersurfaces
- A p-adic approach to the computation of Gröbner bases
- Solving zero-dimensional algebraic systems
- Solving zero-dimensional systems through the rational univariate representation
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Modular algorithms for computing Gröbner bases.
- Fast algorithms for zero-dimensional polynomial systems using duality
- Fault-tolerant modular reconstruction of rational numbers
- Validity proof of Lazard's method for CAD construction
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Usage of modular techniques for efficient computation of ideal operations
- Modular strategic SMT solving with \textbf{SMT-RAT}
- Parallelization of modular algorithms
- Gröbner bases with coefficients in rings
- Implementation of prime decomposition of polynomial ideals over small finite fields
- Computational Linear and Commutative Algebra
- Primary decomposition of zero-dimensional ideals over finite fields
- Maximal quotient rational reconstruction
- Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals
