Efficient computation of the Zassenhaus formula

Abstract

A new recursive procedure to compute the Zassenhaus formula up to high order is presented, providing each exponent in the factorization directly as a linear combination of independent commutators and thus containing the minimum number of terms. The recursion can be easily implemented in a symbolic algebra package and requires much less computational effort, both in time and memory resources, than previous algorithms. In addition, by bounding appropriately each term in the recursion, it is possible to get a larger convergence domain of the Zassenhaus formula when it is formulated in a Banach algebra.

14 pages, 1 figure. Accepted for publication in Comput. Phys. Commun

References in corpus (3)

• An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications
• A note on the Zassenhaus product formula
• The Baker-Campbell-Hausdorff formula in the free metabelian Lie algebra

Cited by in corpus (10)

• Periodically-driven quantum systems: Effective Hamiltonians and engineered gauge fields
• Effects of time ordering in quantum nonlinear optics
• A numerical study of vector resonant relaxation
• A note on large gauge transformations in double field theory
• Pair production of Dirac particles in a d+1-dimensional noncommutative space-time
• The exponential parameterization of the quark mixing matrix
• Well-posedness of non-autonomous linear evolution equations for generators whose commutators are scalar
• Negative probability
• Wave propagation in anisotropic viscoelasticity
• Exactly decohering quantum measurement without environment