Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
From MaRDI portal
Publication:355525
DOI10.1155/2013/352806zbMath1285.13036OpenAlexW2038885250WikidataQ58994866 ScholiaQ58994866MaRDI QIDQ355525
Publication date: 25 July 2013
Published in: ISRN Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/352806
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items (2)
SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Artificial discontinuities of single-parametric Gröbner bases
- Pivoting in extended rings for computing approximate Gröbner bases
- Detection and validation of clusters of polynomial zeros
- Floating point Gröbner bases.
- Toric Newton method for polynomial homotopies
- Precise numerical computation
- Solving parametric polynomial systems
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Pseudofactors of multivariate polynomials
- Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study
- Term Cancellations in Computing Floating-Point Gröbner Bases
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- The approximate GCD of inexact polynomials
- Generalized normal forms and polynomial system solving
This page was built for publication: Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
