Efficient computation of zero-dimensional Gro¨bner bases by change of ordering
Journal of Symbolic Computation
Hilbert functions and the Buchberger algorithm
Journal of Symbolic Computation
Selected papers presented at the international IMACS symposium on Symbolic computation, new trends and developments
Stabilization of polynomial systems solving with Groebner bases
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Efficient algorithms for ideal operations (extended abstract)
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Riemann surfaces, plane algebraic curves and their period matrices
Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
ISAAC '88 Proceedings of the International Symposium ISSAC'88 on Symbolic and Algebraic Computation
Computing floating-point gröbner bases stably
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
Computer Mathematics
Stable normal forms for polynomial system solving
Theoretical Computer Science
A new Gröbner basis conversion method based on stabilization techniques
Theoretical Computer Science
Isolating the real roots of the piecewise algebraic variety
Computers & Mathematics with Applications
A Study on Gröbner Basis with Inexact Input
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Term cancellations in computing floating-point Gröbner bases
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Computing a structured Gröbner basis approximately
Proceedings of the 36th international symposium on Symbolic and algebraic computation
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Journal of Symbolic Computation
Intervals, syzygies, numerical gröbner bases: a mixed study
CASC'06 Proceedings of the 9th international conference on Computer Algebra in Scientific Computing
Selecting lengths of floats for the computation of approximate Gröbner bases
Journal of Symbolic Computation
Structures of precision losses in computing approximate Gröbner bases
Journal of Symbolic Computation
Hi-index | 0.00 |
In this paper we consider the problem of the use of approximate arithmetics in Gröbner basis computation. This is useful to reduce the cost of integer arithmetic, but is especially necessary for overdetermined systems whose coefficients are only approximately known.We report on some numerical experiments, that show that the intrinsic instability of the problem is high but not such as to make the problem unmanageable, and that there is space to improve the numerical stability of the algorithms.We suggest some algorithms to deal with the case of overdetermined and unstable systems.