An algorithm for computing coefficients of words in expressions involving exponentials and its application to the construction of exponential integrators (Q2175578)

The paper discusses the implementation of the formal derivation of order conditions for the numerical solution of certain evolution equations. The evolution equations here discussed are special first-order differential equations. To determine numerical solutions to such equations, discrete integration schemes like Runge-Kutta methods can be used. These provide systems of polynomial equations, which need to be solved. The order conditions are a special system of equations that guarantee that if a few terms in the Taylor expansion of the local error vanish, then all terms up to a certain degree vanish as well. The paper does not provide new methods, but rather provides an implementation of recently proposed algorithms. The relevant theory is quickly recalled and implemented algorithms are presented in full detail. The implementation is performed for the computer algebra system Maple and uses a previously published efficient algorithm to determine the coefficients of words in expressions of the form \(e^{\Phi_k} \dotsm e^{\Phi_1} - e^{\Omega}\), where \(\Omega, \Phi_1, \dotsc, \Phi_k\) are linear combinations of noncommuting variables and commutators of them. It is demonstrated that the implementation can handle non-trivial cases. For the entire collection see [Zbl 1428.68016].