Efficient computation of the Zassenhaus formula

@article{Casas2012EfficientCO,
  title={Efficient computation of the Zassenhaus formula},
  author={Fernando Casas and Ander Murua and Mladen Nadinic},
  journal={Computer Physics Communications},
  year={2012},
  volume={183},
  pages={2386-2391}
}
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… CONTINUE READING
1
Twitter Mention

Figures, Tables, and Topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

On the convergence of exponential operators—the Zassenhaus formula

M. Suzuki
  • BCH formula and systematic approximants, Commun. Math. Phys. 57
  • 1977
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

On the convergence of the Zassenhaus formula

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Computing the Baker-Campbell-Hausdorff series and the Zassenhaus product

  • Computer Physics Communications
  • 2009
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

On the exponential solution of differential equations for a linear operator

W. Magnus
  • Commun. Pure Appl. Math. 7
  • 1954
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL