Efficient computation of the Zassenhaus formula
View/ Open
Metadata
Show full item recordcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONMetadata
Title
Efficient computation of the Zassenhaus formulaDate
2012-11Publisher
ElsevierISSN
0010-4655Type
info:eu-repo/semantics/articlePublisher version
http://www.sciencedirect.com/science/article/pii/S001046551200207XVersion
info:eu-repo/semantics/publishedVersionAbstract
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 ... [+]
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 [-]
Is part of
Computer Physics Communications, Vol. 183, num. 11, November 2012Rights
Copyright © 2012, Elsevier
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
This item appears in the folowing collection(s)
- MAT_Articles [749]