𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ritt's algorithm, Gröbner basis and discretization

✍ Scribed by G. Calandrini; L. Castro; E. Paolini; A.C. Desages

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
773 KB
Volume
26
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis

In

this paper, the application of commutative and differential algebra to system theory is presented. In particular, two alternatives for solving a continuous-time system discretization problem are described. The purpose is to obtain a discrete-time version of Flies& generalized canonical observability form.

📜 SIMILAR VOLUMES

A Fast Algorithm for Gröbner Basis Conve
A Fast Algorithm for Gröbner Basis Conversion and its Applications
✍ Quoc-Nam Tran 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 362 KB

The Gröbner walk method converts a Gröbner basis by partitioning the computation of the basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of equations. The method works with ideals of zerodimension as well as positive dimension. Typicall

A Generalization of Gröbner Basis Algori
A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings
✍ Klaus Madlener; Birgit Reinert 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 656 KB

It is well-known that for the integral group ring of a polycyclic group several decision problems are decidable, in particular the ideal membership problem. In this paper we define an effective reduction relation for group rings over polycyclic groups. This reduction is based on left multiplication