arXiv · 1204.0389
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.
Explore related subjects
Keep this discovery
Fernando Casas, Ander Murua, Mladen Nadinic. 2012-06-15. Efficient computation of the Zassenhaus formula. https://doi.org/10.1016/j.cpc.2012.06.006
Cite the original work for its findings. Save a collection to share your selection of sources.