کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6919050 1447795 2018 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Faster tensor canonicalization
ترجمه فارسی عنوان
کانونیزاسیون تنگر سریع تر
موضوعات مرتبط
مهندسی و علوم پایه شیمی شیمی تئوریک و عملی
چکیده انگلیسی
The Butler-Portugal algorithm for obtaining the canonical form of a tensor expression, by permuting its n index labels with respect to slot symmetries and dummy-index renaming, suffers, in certain cases with a high degree of symmetry, from O(n!) explosion in both computation time and memory. We present a modified algorithm which alleviates this problem in the most common cases - tensor expressions with subsets of indices which are totally symmetric or totally antisymmetric - in polynomial time. We also present an implementation of the label-renaming mechanism which improves upon that of the original Butler-Portugal algorithm, thus providing a significant speed increase for the average case as well as the highly-symmetric special case. The worst-case behavior remains O(n!), although it occurs in more limited situations less likely to appear in actual computations. We comment on possible strategies to take if the nature of a computation should make these situations more likely.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Physics Communications - Volume 228, July 2018, Pages 123-145
نویسندگان
,