Titlebook: EUROSAM 84; International Sympos John Fitch Conference proceedings 1984 Springer-Verlag Berlin Heidelberg 1984 Computeralgebra.algebra.algo

GNAW

,Algorithms for computing Gr?bner bases of polynomial ideals over various Euclidean rings,of polynomial ideals over a field. A general theorem exhibiting the uniqueness of a reduced Gr?bner basis of an ideal, determined by the ordering used on indeterminates and other conditions, is given.

forager

BIAS

Pamphlet

短程旅游

地牢

On the application of symbolic computation to nonlinear control theory, number of independent solutions for a system of linear partial differential equations of first order. The algorithms are based on the computation of certain distributions given a set of vector fields. Examples of application to robotics and power system equations are briefly discussed.

aplomb

Detecting torsion divisors on curves of genus 2,the curve. This allows one to calculate a bound on the torsion which seems better than the bound derived from Riemann-Weil theory. Finally, we discuss briefly a different approach which is valid for all hy — perelliptic curves, at the cost of a considerable increase in complexity.

A簡潔的

A pure and really simple initial functional algebraic language,e experimental LISP system in Bath that allows for full environment closures, ways have been discovered in which eager (applicative) evaluation and lazy (normal) evaluation strategies can be applied to computer algebra. The system is demonstrated on some well known sample programs.

MAZE

果仁

w symbolic systems can compute automatically: (i) the dimension of the accessible set from a particular state for a nonlinear control system; (ii) the number of independent solutions for a system of linear partial differential equations of first order. The algorithms are based on the computation of