An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications

From MaRDI portal
Publication:3650484

DOI10.1063/1.3078418zbMATH Open1202.17004arXiv0810.2656OpenAlexW2003082771MaRDI QIDQ3650484FDOQ3650484


Authors: Fernando Casas, Ander Murua Edit this on Wikidata


Publication date: 14 December 2009

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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 mathcalL(X,Y) generated by X and Y. It is based on the close relationship of mathcalL(X,Y) with a Lie algebraic structure of labeled rooted trees. With this algorithm, the computation of the BCH series up to degree 20 (111013 independent elements in mathcalL(X,Y)) takes less than 15 minutes on a personal computer and requires 1.5 GBytes 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.


Full work available at URL: https://arxiv.org/abs/0810.2656




Recommendations




Cites Work


Cited In (37)





This page was built for publication: An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650484)