Gsolve: a faster algorithm for solving systems of algebraic equations

Authors:
Manuel Bronstein
Affiliations:
Univ. of California, Berkeley
Venue:
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Year:
1986

Citing 4
Cited 0

The Calculation of Multivariate Polynomial Resultants

Journal of the ACM (JACM)
A note on the complexity of constructing Gröbner-Bases

EUROCAL '83 Proceedings of the European Computer Algebra Conference on Computer Algebra
Canonical representatives for residue classes of a polynomial ideal

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A theoretical basis for the reduction of polynomials to canonical forms

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply the elimination property of Gröbner bases with respect to pure lexicographic ordering to solve systems of algebraic equations. We suggest reasons for this approach to be faster than the resultant technique, and give examples and timings that show that it is indeed faster, and more correct, than MACSYMA's solve.