Term Cancellations in Computing Floating-Point Gröbner Bases

DOI10.1007/978-3-642-15274-0_20zbMath1290.68137OpenAlexW2098186141MaRDI QIDQ3589078

Fujio Kako, Tateaki Sasaki

Publication date: 10 September 2010

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-15274-0_20

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (4)

Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ A subresultant-like theory for Buchberger's procedure ⋮ Pivoting in extended rings for computing approximate Gröbner bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing border bases
• Remarks on automatic algorithm stabilization
• On the stability of Gröbner bases under specializations
• Floating point Gröbner bases.
• Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study
• Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
• A Study on Gröbner Basis with Inexact Input
• Computing Gröbner Bases within Linear Algebra
• Numerical Polynomial Algebra
• Computer Algebra in Scientific Computing
• Degree reduction under specialization

This page was built for publication: Term Cancellations in Computing Floating-Point Gröbner Bases