论文信息 - Macsyma Computation of Local Minimal Realization of Dynamical Systems of which Generating Power Series are Finite

Macsyma Computation of Local Minimal Realization of Dynamical Systems of which Generating Power Series are Finite

We present here a package of Macsyma programs, allowing the manipulation of words, and noncommutative power series over some finite alphabet. On the basis of the works of M.Fliess and C.Reutenauer, concerning local realization of nonlinear dynamical systems, we present an algorithm allowing the computation of the local and minimal realization of finite generating power series. We describe that algorithm in the computer algebra system Macsyma.

N. E. Oussous

[1] David E. Radford,et al. A natural ring basis for the shuffle algebra and an application to group schemes , 1979 .

[2] M. Fliess. Réalisation locale des systèmes non linéaires, algèbres de Lie filtrées transitives et séries génératrices non commutatives , 1983 .

[3] Jean-Pierre Duval,et al. Generation of a section of conjugation classes and Lyndon word tree of limited length , 1988 .

[4] M. Fliess,et al. Fonctionnelles causales non linaires et indtermines non commutatives , 1981 .

[5] Guy Melançon,et al. Lyndon Words, Free Algebras and Shuffles , 1989, Canadian Journal of Mathematics.

[6] N. E. Oussous,et al. Local and Minimal Realization of Nonlinear Dynamical Systems and Lyndon Words , 1989 .

[7] C. Reutenauer. The Local Realization of Generating Series of Finite Lie Rank , 1986 .