Computing Gröbner Bases within Linear Algebra

DOI10.1007/978-3-642-04103-7_27zbMath1260.68485OpenAlexW170672925MaRDI QIDQ3644110

Akira Suzuki

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_27

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)

Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation ⋮ Term Cancellations in Computing Floating-Point Gröbner Bases

Uses Software

• FGb
• Magma
• Risa/Asir
• SINGULAR
• slimgb

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hilbert functions and the Buchberger algorithm
• SINGULAR and applications
• The Gröbner fan of an ideal
• On an installation of Buchberger's algorithm
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• The Magma algebra system. I: The user language
• Converting bases with the Gröbner walk
• Slimgb: Gröbner bases with slim polynomials
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems

This page was built for publication: Computing Gröbner Bases within Linear Algebra