Related papers: A simple and efficient algorithm for computing the…
A simple expression is derived for the terms in the Baker-Campbell-Hausdorff series. One formulation of the result involves a finite number of operations with matrices of rational numbers. Generalizations are discussed.
This short paper presents an efficient implementation of Baker-Campbell-Hausdorff formula for calculating the logarithm of product of two possibly non-commutative Lie group elements using only Lie algebra terms.
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…
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 $X$ and $Y$ are not necessarily commuting, in terms of homogeneous multinomials…
For the computation of terms of the Baker-Campbell-Hausdorff series $H = \log(e^Ae^B})$ some a priori knowledge about the denominators of the coefficients of the series can be beneficial. In this paper an explicit formula for the…
In a recent paper the author derived a formula for calculating common denominators for the homogeneous components of the Baker-Campbell-Hausdorff (BCH) series. In the present work it is proved that this formula actually yields the smallest…
It is pointed out that Reinsch's matrix operation formulation of calculating the Baker-Campbell-Hausdorff series [math-ph/9905012] is equivalent to the straightforward series expansion. The amount of calculation does not decrease by his…
An exact representation of the Baker-Campbell-Hausdorff formula as a power series in just one of the two variables is constructed. Closed form coefficients of this series are found in terms of hyperbolic functions, which contain all of the…
The classical Baker-Campbell-Hausdorff formula gives a recursive way to compute the Hausdorff series H=ln(e^X e^Y) for non-commuting X,Y. Formally H lives in the graded completion of the free Lie algebra L generated by X,Y. We present a…
The Baker-Campbell-Hausdorff formula was recently resummed exactly in one variable, and left as a power series in the other (Moodie and Long 2021 J. Phys. A: Math. Theor. 54 015208). The coefficients of the power series were provided as a…
In this work we introduce the contact Heisenberg algebra which is the restriction of the Jacobi algebra on contact manifolds to the linear and constant functions. We give the exact expression of its corresponding Baker-Campbell-Hausdorff…
For noncommutative variables x,y an expansion of log(exp(x)exp(y)) in powers of x+y is obtained.Each term of the series is given by an infinite sum in powers of x-y.The series is represented by diagrams.
Studies in thermodynamics often require the reduction of some first or second order partial derivatives in terms of a smaller basic set. A simple algorithm to perform such a reduction is presented here, together with a review of earlier…
We have studied the infinitesimal Baker-Campbell-Hausdorff formula up to n=4 (Math. Appl. 2 (2013), 61-91). In this note we correct some errors in our calculation for n=4 and presents the calculation for n=5 by using Mathematica.
We get compact expressions for the Baker--Campbell--Hausdorff series $Z = \log(\e^X \, \e^Y)$ in terms of right-nested commutators. The reduction in the number of terms originates from two facts: (i) we use as a starting point an explicit…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
Leveraging techniques from the literature on geometric numerical integration, we propose a new general method to compute exact expressions for the BCH formula. In its utmost generality, the method consists in embedding the Lie algebra of…
A simple algorithm, which exploits the associativity of the BCH formula, and that can be generalized by iteration, extends the remarkable simplification of the Baker-Campbell-Hausdorff (BCH) formula, recently derived by Van-Brunt and…
This article will prove a theorem for the existence of k-factor for k>1 ,and present an efficient algorithm for computing k-factor for all values of k based on this theorem.
We present BSeries.jl, a Julia package for the computation and manipulation of B-series, which are a versatile theoretical tool for understanding and designing discretizations of differential equations. We give a short introduction to the…