Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals
ACM Transactions on Mathematical Software (TOMS)
Some comments on the modular approach to Gröbner-bases
ACM SIGSAM Bulletin
Solution of a general system of equations
ACM SIGSAM Bulletin
Note on "solution of a general system of equations"
ACM SIGSAM Bulletin
On improving approximate results of Buchberger's algorithm by Newton's method
ACM SIGSAM Bulletin
Computer algebra application for classification of integrable non-linear evolution equations
Journal of Symbolic Computation
Buchberger's algorithm and staggered linear bases
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Admissible term orderings used in computer algebra systems
ACM SIGSAM Bulletin
Computing dimension and independent sets for polynomial ideals
Journal of Symbolic Computation
Solving algebraic equations: Combining Buchberger's algorithm with multivariate factorization
Journal of Symbolic Computation
Some comments on term-ordering in Gröbner basis computations
ACM SIGSAM Bulletin
Experimenting the Gröbner basis algorithm with the A1PI system
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Computer classification of integrable coupled KdV-like systems
Journal of Symbolic Computation
A heuristic selection strategy for lexicographic Gröner bases?
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
“One sugar cube, please” or selection strategies in the Buchberger algorithm
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Gröbner bases computation using syzygies
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Solving parametric algebraic systems
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Parallelizing algorithms for symbolic computation using MAPLE
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
A dynamic algorithm for Gröbner basis computation
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation
ACM Transactions on Mathematical Software (TOMS)
A quasi-barrier technique to improve performance of an irregular application
FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Computer algebra handbook
Locating real multiple zeros of a real interval polynomial
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
On a Java computer algebra system, its performance and applications
Science of Computer Programming
HOM4PS-2.0para: Parallelization of HOM4PS-2.0 for solving polynomial systems
Parallel Computing
Unique factorization domains in the java computer algebra system
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
Parallel homotopy algorithms to solve polynomial systems
ICMS'06 Proceedings of the Second international conference on Mathematical Software
Regularized learning in Banach spaces as an optimization problem: representer theorems
Journal of Global Optimization
| Hi-index | 0.00 |
Some notes on the computation of Groebner Bases using Buchberger's algorithm over different coefficient domains and the solution of systems of algebraic equations using Groebner bases are given. Examples demonstrate applicability and its current timits, and show the wide range of problems tractable by this method. The choices of an appropriate variable ordering and a suitable term ordering are of crucial importance for the computing time and space allocation. The ''optimal'' variable ordering is considered, and an improvement for the selection of wdid solutions of the system of algebraic equations is described.