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

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

2008-10-15

arxiv.org/abs/0810.2656v1

Journal of Mathematical Physics 50 (2009), 033513

Physics

Mathematical Physics

30 pages

Scientific paper

10.1063/1.3078418

We provide a new algorithm for generating the Baker--Campbell--Hausdorff (BCH) series $Z = \log(\e^X \e^Y)$ in an arbitrary generalized Hall basis of the free Lie algebra $\mathcal{L}(X,Y)$ generated by $X$ and $Y$. It is based on the close relationship of $\mathcal{L}(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 $\mathcal{L}(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.

Affiliated with

Also associated with

No associations

Rating

An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-302932