A Study on Gröbner Basis with Inexact Input

DOI10.1007/978-3-642-04103-7_22zbMath1239.13036OpenAlexW1651617754MaRDI QIDQ3644104

Kosaku Nagasaka

Publication date: 10 November 2009

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04103-7_22

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (2)

Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Term Cancellations in Computing Floating-Point Gröbner Bases

Uses Software

• FGb
• PGB

Cites Work

• Comprehensive Gröbner bases
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Floating point Gröbner bases.
• Canonical comprehensive Gröbner bases
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Study on Gröbner Basis with Inexact Input