An efficient algorithm for computing the Baker–Campbell–Hausdorff series and some of its applications
Visualitza/
Metadades
Mostra el registre complet de l'elementcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONMetadades
Títol
An efficient algorithm for computing the Baker–Campbell–Hausdorff series and some of its applicationsData de publicació
2009-03Editor
American Institute of PhysicsISSN
0022-2488Cita bibliogràfica
CASAS, Fernando; MURUA, Ander. An efficient algorithm for computing the Baker–Campbell–Hausdorff series and some of its applications. Journal of Mathematical Physics, 2009, vol. 50, no 3, p. 033513-1- 033513-23Tipus de document
info:eu-repo/semantics/articleVersió de l'editorial
http://jmp.aip.org/resource/1/jmapaq/v50/i3/p033513_s1Versió
info:eu-repo/semantics/publishedVersionParaules clau / Matèries
Resum
We provide a new algorithm for generating the Baker–Campbell–Hausdorff (BCH) seriesZ = log(eXeY) in an arbitrary generalized Hall basis of the free Lie algebra L(X,Y)generated by X and Y. It is based on the close ... [+]
We provide a new algorithm for generating the Baker–Campbell–Hausdorff (BCH) seriesZ = log(eXeY) in an arbitrary generalized Hall basis of the free Lie algebra L(X,Y)generated by X and Y. It is based on the close relationship of L(X,Y) with a Lie algebraic structure of labeled rooted trees. With this algorithm, the computation of the BCH series up to degree of 20 [111 013 independent elements in L(X,Y)] takes less than 15 min on a personal computer and requires 1.5 Gbytes of memory. We also address the issue of the convergence of the series, providing an optimal convergence domain when X and Y are real or complex matrices [-]
Publicat a
Journal of mathematical physics, 2009, v. 50, n. 3Drets d'accés
© 2009 American Institute of Physics
http://www.aip.org/pubservs/web_posting_guidelines.html
info:eu-repo/semantics/openAccess
http://www.aip.org/pubservs/web_posting_guidelines.html
info:eu-repo/semantics/openAccess
Apareix a les col.leccions
- MAT_Articles [770]