Computing floating-point Gröbner bases accurately
DOI10.1145/1940475.1940504zbMATH Open1305.68372OpenAlexW2015267827MaRDI QIDQ5175263FDOQ5175263
Authors: Tateaki Sasaki, Fujio Kako
Publication date: 20 February 2015
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1940475.1940504
Recommendations
Direct numerical methods for linear systems and matrix inversion (65F05) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cited In (10)
- Term cancellations in computing floating-point Gröbner bases
- Twin-float arithmetic
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields
- A practical method for floating-point Gröbner basis computation
- A practical method for floating-point Gröbner basis computation
- Analysis of normal-form algorithms for solving systems of polynomial equations
- Selecting lengths of floats for the computation of approximate Gröbner bases
- Structures of precision losses in computing approximate Gröbner bases
- Title not available (Why is that?)
- Floating point Gröbner bases.
This page was built for publication: Computing floating-point Gröbner bases accurately
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175263)