کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10350003 863753 2012 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Efficient computation of the Zassenhaus formula
موضوعات مرتبط
مهندسی و علوم پایه شیمی شیمی تئوریک و عملی
پیش نمایش صفحه اول مقاله
Efficient computation of the Zassenhaus formula
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Physics Communications - Volume 183, Issue 11, November 2012, Pages 2386-2391
نویسندگان
, , ,