Computation, on Macsyma, of the minimal differential representation of noncommutative polynomials (Q756429): Difference between revisions

The paper describes an algorithm which computes the local minimal realization of nonlinear dynamical systems of which generating power series are finite. The algorithm has as input parameter the Chen-Fox- Lyndon basis of the free Lie-algebra generated by the command alphabet and uses the fact that the Lyndon words are a transcendence basis of noncommutative polynomial algebra with Shuffle product. The result of the algorithm is obtained as a linear combination on polynomials that are built as linear combinations of shuffles of Lyndon words. The algorithm is described in the algebraic computation language Macsyma.