A simple and efficient algorithm for computing the Baker-Campbell-Hausdorff series
Preprint
Abstract
A new algorithm for computing coefficients of the Baker--Campbell--Hausdorff series is presented, which can be straightforwardly implemented in any general-purpose programming language or computer algebra system. The algorithm avoids rational arithmetic and performs all its calculations in pure integer arithmetic, allowing for a very efficient implementation. An implementation in the Julia programming language is available.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- A relatively short self-contained proof of the Baker–Campbell–Hausdorff theoremExpositiones Mathematicae, 2021
- Simplifying the Reinsch algorithm for the Baker–Campbell–Hausdorff seriesJournal of Mathematical Physics, 2016
- A simple expression for the terms in the Baker–Campbell–Hausdorff seriesJournal of Mathematical Physics, 2000
- Numerical Values of Goldberg's Coefficients in the Series for log(e x e y )Mathematics of Computation, 1987
- Cyclic relations and the Goldberg coefficients in the Campbell-Baker-Hausdorff formulaProceedings of the American Mathematical Society, 1982