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
✦ LIBER ✦
A combinatorial approach to the generalized Baker–Campbell–Hausdorff–Dynkin formula
✍ Scribed by Leonardo Saenz; Rodolfo Suarez
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 166 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
On a computationally simple form of the
✍
Ignacy Dulȩba
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 141 KB
An elementary proof of the Baker-Campbel
✍
Dragomir Ž. Djoković
📂
Article
📅
1975
🏛
Springer-Verlag
🌐
French
⚖ 90 KB
A q-analog of the campbell-baker-hausdor
✍
David L. Reiner
📂
Article
📅
1983
🏛
Elsevier Science
🌐
English
⚖ 471 KB
The Baker-Campbell-Hausdorff formula for
✍
C. Aragone; A. Restuccia
📂
Article
📅
1979
🏛
Springer
🌐
English
⚖ 229 KB