Computer algebra of polynomials: A modified method of eliminating unknowns
computer algebraGrothendieck residueGröbner baseslogarithmic residuemethod of eliminating unknownsnumerical examplesperformancesystems of nonlinear algebraic equations
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Symbolic computation and algebraic computation (68W30)
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.
- Application of computer algebra systems in a modified method of the elimination of unknowns.
- A numerical elimination method for polynomial computations
- Polynomial algorithms in computer algebra
- An elimination method for polynomial systems
- Computer algebra method for orthogonal polynomials
- scientific article; zbMATH DE number 3928209
- scientific article; zbMATH DE number 2006442
- Problems of computer algebra involved in the search for polynomial solutions of linear differential and difference equations
- scientific article; zbMATH DE number 49119
- Application of computer algebra systems in a modified method of the elimination of unknowns.
- MAPLE---procedures for finding the resultants of systems of nonlinear algebraic equations
- Elimination methods of unknowns from nonlinear systems
- scientific article; zbMATH DE number 49119 (Why is no real title available?)
- scientific article; zbMATH DE number 1228465 (Why is no real title available?)
- scientific article; zbMATH DE number 7092087 (Why is no real title available?)
- Analogs of recurrent Newton formulas
This page was built for publication: Computer algebra of polynomials: A modified method of eliminating unknowns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1385879)
