Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
From MaRDI portal
Publication:3598002
DOI10.1007/978-3-540-87827-8_23zbMath1166.68380OpenAlexW1843011993MaRDI QIDQ3598002
Publication date: 29 January 2009
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_23
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Roundoff error (65G50)
Related Items (8)
Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases ⋮ Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation ⋮ A subresultant-like theory for Buchberger's procedure ⋮ Pivoting in extended rings for computing approximate Gröbner bases ⋮ Term Cancellations in Computing Floating-Point Gröbner Bases ⋮ Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation ⋮ A general method of finding new symplectic schemes for Hamiltonian mechanics
Cites Work
- Remarks on automatic algorithm stabilization
- Floating point Gröbner bases.
- Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- Numerical Polynomial Algebra
- Computer Algebra in Scientific Computing
- Subresultants and Reduced Polynomial Remainder Sequences
- Degree reduction under specialization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation