Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
DOI10.1155/2013/352806zbMATH Open1285.13036OpenAlexW2038885250WikidataQ58994866 ScholiaQ58994866MaRDI QIDQ355525FDOQ355525
Authors: Daniel A. Lichtblau 
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
Recommendations
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical algorithms for computer arithmetic, etc. (65Y04)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The approximate GCD of inexact polynomials
- Title not available (Why is that?)
- Generalized normal forms and polynomial system solving
- Solving parametric polynomial systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Detection and validation of clusters of polynomial zeros
- Floating point Gröbner bases.
- Toric Newton method for polynomial homotopies
- Precise numerical computation
- Title not available (Why is that?)
- Computing approximate GCD of multivariate 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Artificial discontinuities of single-parametric Gröbner bases
- Pivoting in extended rings for computing approximate Gröbner bases
Cited In (6)
- Computing a structured Gröbner basis approximately
- Gröbner bases and generalized Padé approximation
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Structures of precision losses in computing approximate Gröbner bases
- An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases
Uses Software
This page was built for publication: Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355525)
