Computer algebra of polynomials: A modified method of eliminating unknowns (Q1385879)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computer algebra of polynomials: A modified method of eliminating unknowns |
scientific article |
Statements
Computer algebra of polynomials: A modified method of eliminating unknowns (English)
0 references
23 June 1998
0 references
One of the basic problems of the computer algebra of polynomials is the problem of eliminating unknowns from systems of nonlinear algebraic equations (SNAEs). The modified method of eliminating unknowns is based on the multidimensional theory of residues (multidimensional logarithmic residue and the Grothendieck residue and its transformation). The essence of the method is the calculation of the sums of the values of an arbitrary polynomial at the roots of a given SNAEs without determination of the roots themselves. This makes it possible to evaluate sums of powers of roots and therefore, resultants of a given system with respect to various sets of variables (with the help of the classic Newtonian recursion relations or their multidimensional modifications). Combining the Gröbner method of bases with our method makes it possible to reduce the time of computing a resultant. To implement the suggested method on a personal computer, we used the system REDUCE (Version 3.4). The performance of the developed software was tested for a number of actual SNAEs with letter coefficients, including those used in chemical kinetics.
0 references
numerical examples
0 references
Gröbner bases
0 references
computer algebra
0 references
systems of nonlinear algebraic equations
0 references
method of eliminating unknowns
0 references
logarithmic residue
0 references
Grothendieck residue
0 references
performance
0 references