Efficient computation of the Zassenhaus formula
Mathematical Physics
2012-08-06 v2 math.MP
Rings and Algebras
Quantum Physics
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.
Cite
@article{arxiv.1204.0389,
title = {Efficient computation of the Zassenhaus formula},
author = {Fernando Casas and Ander Murua and Mladen Nadinic},
journal= {arXiv preprint arXiv:1204.0389},
year = {2012}
}
Comments
14 pages, 1 figure. Accepted for publication in Comput. Phys. Commun