Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
From MaRDI portal
Publication:3598002
Recommendations
Cites work
- scientific article; zbMATH DE number 5168255 (Why is no real title available?)
- scientific article; zbMATH DE number 1253973 (Why is no real title available?)
- scientific article; zbMATH DE number 516973 (Why is no real title available?)
- scientific article; zbMATH DE number 2151244 (Why is no real title available?)
- Computer Algebra in Scientific Computing
- Degree reduction under specialization
- Floating point Gröbner bases.
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study
- Numerical Polynomial Algebra
- Remarks on automatic algorithm stabilization
- Subresultants and Reduced Polynomial Remainder Sequences
Cited in
(11)- Term cancellations in computing floating-point Gröbner bases
- A general method of finding new symplectic schemes for Hamiltonian mechanics
- A subresultant-like theory for Buchberger's procedure
- A practical method for floating-point Gröbner basis computation
- A practical method for floating-point Gröbner basis computation
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- scientific article; zbMATH DE number 516973 (Why is no real title available?)
- Triangularizing kinematic constraint equations using Gröbner bases for real-time dynamic simulation
- An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
- Pivoting in extended rings for computing approximate Gröbner bases
This page was built for publication: Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598002)