A new Gröbner basis conversion method based on stabilization techniques
From MaRDI portal
Publication:2378509
DOI10.1016/j.tcs.2008.09.007zbMath1181.68329OpenAlexW2034066756MaRDI QIDQ2378509
Hiroshi Sekigawa, Kiyoshi Shirayanagi
Publication date: 8 January 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.007
Gröbner basisbasis conversionalgorithm stabilizationfloating-point Gröbner basissymbolic and numeric computation
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (1)
Uses Software
Cites Work
- Hilbert functions and the Buchberger algorithm
- Approximate GCD and its application to ill-conditioned algebraic equations
- Special issue: Symbolic numeric algebra for polynomials
- Remarks on automatic algorithm stabilization
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Converting bases with the Gröbner walk
- Floating point Gröbner bases.
- A modular method to compute the rational univariate representation of zero-dimensional ideals
- Complexity of Computations with Matrices and Polynomials
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new Gröbner basis conversion method based on stabilization techniques