On improving approximate results of Buchberger's algorithm by Newton's method

Authors:
W. Trinks
Affiliations:
Karlsruhe
Venue:
ACM SIGSAM Bulletin
Year:
1984

Citing 1
Cited 4

Computer algebra: symbolic and algebraic computation (2nd ed.)

Computer algebra: symbolic and algebraic computation (2nd ed.)

Some examples for solving systems of algebraic equations by calculating groebner bases

Journal of Symbolic Computation
A p-adic approach to the computation ofGröbner bases

Journal of Symbolic Computation
On radical zero-dimensional ideals

Journal of Symbolic Computation
Size of coefficients of lexicographical Groöbner bases: the zero-dimensional, radical and bivariate case

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In some applications of Buchberger's algorithm it is possible to avoid the use of multiple precision arithmetics in the main part of the calculations, even if the results are large numbers.