𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An elementary proof of the Baker-Campbell-Hausdorff-Dynkin formula

✍ Scribed by Dragomir Ž. Djoković

Publisher
Springer-Verlag
Year
1975
Tongue
French
Weight
90 KB
Volume
143
Category
Article
ISSN
0025-5874

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A combinatorial approach to the generali
A combinatorial approach to the generalized Baker–Campbell–Hausdorff–Dynkin formula
✍ Leonardo Saenz; Rodolfo Suarez 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 166 KB

The aim of this paper is to obtain an explicit expression, instead of using a recursive method, for the nth term coe cient of the generalized Baker-Campbell-Hausdor -Dynkin (gBCHD) formula. The gBCHD formula has been applied to control theory, specially to nonholonomic motion planning.

On a computationally simple form of the
On a computationally simple form of the generalized Campbell–Baker–Hausdorff–Dynkin formula
✍ Ignacy Dulȩba 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 141 KB

In this paper a computationally simple form of the generalized Campbell-Baker-Hausdor -Dynkin formula (GCBHD) is given. Simpliÿcations arise from both combinatorial (explicit) as well as algorithmic (implicit) arguments. On generating the Ph. Hall basis in a special form, and introducing a speciÿc s

On the convergence and optimization of t
On the convergence and optimization of the Baker–Campbell–Hausdorff formula
✍ Sergio Blanes; Fernando Casas 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 296 KB

In this paper the problem of the convergence of the Baker-Campbell-Hausdorff series for Z = log(e X e Y ) is revisited. We collect some previous results about the convergence domain and present a new estimate which improves all of them. We also provide a new expression of the truncated Lie presentat