𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Application of Gröbner bases to problems of movement of a particle

✍ Scribed by N.I. Ioakimidis; E.G. Anastasselou


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
608 KB
Volume
27
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis


The cfassicd method of Grijbner bases for multivariate polynomials in computer alge bra and the related Buchberger's algorithm and its modifications for the computation of such bases are applied to some elementary problems of kinematics as well as to the classical Kepler-Newton problem in celestial mechanics, where, beyond the variables in the polynomials, the differential operator D appears se well. The popular computer algebra system Maple V and the related standard package were used for this purpose and several possibilities of using Grijbner bases for the proof and/or the derivation of formulae in mechanics are illustrated. The present results generalize well-known results for the proof/derivation of geometric theorems by using classical Grijbner bases and related techniques and they illustrate the power of commercial computer algebra systems in the aforementioned tasks in kinematics. Modifications and generalizations of the present approach are also possible.


📜 SIMILAR VOLUMES


Properties of Gröbner Bases and Applicat
✍ Mulan Liu; Lei Hu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 430 KB

In this paper the properties of Gröbner bases of zero-dimensional ideals are studied. A basis of the space of linear recurring arrays and the trace expression of linear recurring arrays are given.

Gröbner Bases with Respect to Generalize
✍ FRANZ PAUER; SANDRO ZAMPIERI 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 544 KB

We present an algorithm to decide whether a homogeneous linear partial difference equation with constant coefficients provides an unfalsified model for a finite set of observations, which consist in multiindexed signals, known on a finite subset of N n . To this aim we introduce the concept of "gene

On the Complexity of Gröbner Bases Conve
✍ Michael Kalkbrener 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paper, the complexity of the conversion problem for Gröbner bases is investigated. It is shown that for adjacent Gröbner bases F and G, the maximal degree of the polynomials in G, denoted by deg(G), is bounded by a quadratic polynomial in deg(F ). For non-adjacent Gröbner bases, however, the