Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs

DOI10.1155/2013/352806MaRDI QIDQ355525zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

approximate GCD'sapproximate Gröbner bases

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• scientific article; zbMATH DE number 2151244
• Approximate polynomial GCD by approximate syzygies
• The approximate GCD of inexact polynomials
• An algorithm for computing certified approximate GCD of n univariate polynomials
• Certified approximate univariate GCDs

Cites work

• scientific article; zbMATH DE number 4132308 (Why is no real title available?)
• scientific article; zbMATH DE number 5117360 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 4076472 (Why is no real title available?)
• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 1253973 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 1254271 (Why is no real title available?)
• scientific article; zbMATH DE number 516973 (Why is no real title available?)
• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• scientific article; zbMATH DE number 1104294 (Why is no real title available?)
• scientific article; zbMATH DE number 2151203 (Why is no real title available?)
• scientific article; zbMATH DE number 2151244 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Artificial discontinuities of single-parametric Gröbner bases
• Computing approximate GCD of multivariate polynomials
• Detection and validation of clusters of polynomial zeros
• Floating point Gröbner bases.
• Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
• Generalized normal forms and polynomial system solving
• Intervals, Syzygies, Numerical Gröbner Bases: A Mixed Study
• Pivoting in extended rings for computing approximate Gröbner bases
• Precise numerical computation
• Pseudofactors of multivariate polynomials
• Solving parametric polynomial systems
• Term cancellations in computing floating-point Gröbner bases
• The approximate GCD of inexact polynomials
• Toric Newton method for polynomial homotopies

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

Describes a project that uses

Uses Software

• MultRoot
• Mathematica

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)