Abstract
We provide a new algorithm for generating the Baker–Campbell–Hausdorff (BCH) series Z=log(eXeY) in an arbitrary generalized Hall basis of the free Lie algebra L(X,Y) generated by X and Y. It is based on the close relationship of L(X,Y) with a Lie algebraic structure of labeled rooted trees. With this algorithm, the computation of the BCH series up to degree of 20 [111 013 independent elements in L(X,Y)] takes less than 15min on a personal computer and requires 1.5Gbytes of memory. We also address the issue of the convergence of the series, providing an optimal convergence domain when X and Y are real or complex matrices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
