Simplifying the Reinsch algorithm for the Baker-Campbell-Hausdorff series
Alexander Van-Brunt (1), Matt Visser (1) ((1) Victoria University, of Wellington)

TL;DR
This paper simplifies the Reinsch algorithm for computing the Baker-Campbell-Hausdorff series, providing clearer understanding and bounds on Goldberg coefficients, with implications for mathematical physics and related fields.
Contribution
The authors present a simplified version of the Reinsch algorithm, making the computation of the BCH series more straightforward and analyzing properties of Goldberg coefficients.
Findings
Simplified Reinsch algorithm for BCH series
Established bounds on non-zero Goldberg coefficients
Analyzed growth of multinomial terms in the series
Abstract
The Baker-Campbell-Hausdorff series computes the quantity \begin{equation*} Z(X,Y)=\ln\left( e^X e^Y \right) = \sum_{n=1}^\infty z_n(X,Y), \end{equation*} where and are not necessarily commuting, in terms of homogeneous multinomials of degree . (This is essentially equivalent to computing the so-called Goldberg coefficients.) The Baker-Campbell-Hausdorff series is a general purpose tool of wide applicability in mathematical physics, quantum physics, and many other fields. The Reinsch algorithm for the truncated series permits one to calculate up to some fixed order by using matrices. We show how to further simplify the Reinsch algorithm, making implementation (in principle) utterly straightforward. This helps provide a deeper understanding of the Goldberg coefficients and their properties. For instance we establish strict bounds (and some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
