Efficient computation of the Zassenhaus formula

Details Efficient computation of the Zassenhaus formula Efficient computation of the Zassenhaus formula

2012-04-02

arxiv.org/abs/1204.0389v1

Physics

Mathematical Physics

14 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Efficient computation of the Zassenhaus formula does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient computation of the Zassenhaus formula, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient computation of the Zassenhaus formula will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-509567