arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.2656math-phmath.MP
收藏

计算Baker-Campbell-Hausdorff级数的一个有效算法及其应用

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

Fernando Casas, Ander Murua

摘要:

本文给出了一种在由$X$和$Y$生成的自由李代数$\mathcal{L}(X,Y)$的任意广义Hall基上生成Baker-Campbell-Hausdorff(BCH)级数$Z = \log(\e^X \e^Y)$的新算法.它是基于密切关系的$\mathcal{L}(X,Y)$与李代数结构的标记根树。用这种算法,BCH系列的计算到20度($\mathcal{L}(X,Y)$中的111013个独立元素)在个人计算机上花费不到15分钟,需要1.5千兆字节的存储器。我们还解决了该系列的收敛性问题,提供了一个最佳的收敛域时,$X$和$Y$是真正的或复杂的矩阵。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑