Some recent work is reviewed which relates families of trees to symbolic algorithms for the exact computation of series which approximate solutions of ordinary differential equations. It turns out that the vector space whose basis is the set of finite, rooted trees carries a natural multiplication related to the composition of differential operators, making the space of trees an algebra. This algebraic structure can be exploited to yield a variety of algorithms for manipulating vector fields and the series and algebras they generate
AbstractWe develop the Hopf algebraic structure based on the set of functional graphs, which general...
The research broadly concerned the symbolic computation, mixed numeric-symbolic computation, and dat...
An algorithm for solving linear constant-coefficient ordinary differential equations is presented. T...
The algorithms derived by Grossmann and Larson (1989) are further developed for rewriting expression...
Algorithms previously developed by the author give formulas which can be used for the efficient symb...
The effective parallel symbolic computation of operators under composition is discussed. Examples in...
This note is concerned with the explicit symbolic computation of expressions involving differential ...
This paper is concerned with the effective symbolic computation of operators under composition. Exam...
We discuss the effective symbolic computation of operators under composition. We analyse data struct...
Preliminary work about intrinsic numerical integrators evolving on groups is described. Fix a finite...
Butcher series appear when Runge–Kutta methods for ordinary differential equations are expanded in p...
This thesis is dedicated to the study of nonlinear partial differential equations systems. The chose...
Our aim was to find a graphic numeric solution method for higher-order differential equations and diff...
International audienceWe propose new algorithms for the computation of the first N terms of a vector...
This paper describes some applications of Computer Algebra to Algebraic Analysis also known as D-mo...
AbstractWe develop the Hopf algebraic structure based on the set of functional graphs, which general...
The research broadly concerned the symbolic computation, mixed numeric-symbolic computation, and dat...
An algorithm for solving linear constant-coefficient ordinary differential equations is presented. T...
The algorithms derived by Grossmann and Larson (1989) are further developed for rewriting expression...
Algorithms previously developed by the author give formulas which can be used for the efficient symb...
The effective parallel symbolic computation of operators under composition is discussed. Examples in...
This note is concerned with the explicit symbolic computation of expressions involving differential ...
This paper is concerned with the effective symbolic computation of operators under composition. Exam...
We discuss the effective symbolic computation of operators under composition. We analyse data struct...
Preliminary work about intrinsic numerical integrators evolving on groups is described. Fix a finite...
Butcher series appear when Runge–Kutta methods for ordinary differential equations are expanded in p...
This thesis is dedicated to the study of nonlinear partial differential equations systems. The chose...
Our aim was to find a graphic numeric solution method for higher-order differential equations and diff...
International audienceWe propose new algorithms for the computation of the first N terms of a vector...
This paper describes some applications of Computer Algebra to Algebraic Analysis also known as D-mo...
AbstractWe develop the Hopf algebraic structure based on the set of functional graphs, which general...
The research broadly concerned the symbolic computation, mixed numeric-symbolic computation, and dat...
An algorithm for solving linear constant-coefficient ordinary differential equations is presented. T...