TSFC: a structure-preserving form compiler

TSFC: a structure-preserving form compiler
复制标题

DOI:
10.1137/17m1130642
复制
发表时间:
2017-05
期刊:
SIAM J. Sci. Comput.
影响因子:
--
通讯作者:
Miklós Homolya;L. Mitchell;F. Luporini;D. Ham
Miklós Homolya;L. Mitchell;F. Luporini;D. Ham
中科院分区:
其他
文献类型:
--
作者:
Miklós Homolya;L. Mitchell;F. Luporini;D. Ham

文献摘要

相似文献

形式编译器采用偏微分方程的弱形式的高级描述,并产生执行有限元汇编的低级代码。在本文中,我们提出了两阶段的形式编译器(TSFC),一个新的形式编译器的主要动机是保持输入表达式的结构尽可能长的时间。这有助于在尽可能高的抽象级别上应用优化。TSFC的特点是一种新的,结构保持的方法分离的贡献的形式的局部张量在不连续的伽辽金问题的子块。这使我们能够在编译过程中比其他形式编译器更长时间地保留表达式的张量结构。这也部分地通过两阶段方法来实现,该方法将第一阶段中的有限元构造降低到张量代数与第二阶段中的这些张量操作的调度干净地分开。TSFC还有效地遍历...
A form compiler takes a high-level description of the weak form of partial differential equations and produces low-level code that carries out the finite element assembly. In this paper we present the Two-Stage Form Compiler (TSFC), a new form compiler with the main motivation being to maintain the structure of the input expression as long as possible. This facilitates the application of optimizations at the highest possible level of abstraction. TSFC features a novel, structure-preserving method for separating the contributions of a form to the subblocks of the local tensor in discontinuous Galerkin problems. This enables us to preserve the tensor structure of expressions longer through the compilation process than is possible with other form compilers. This is also achieved in part by a two-stage approach that cleanly separates the lowering of finite element constructs to tensor algebra in the first stage, from the scheduling of those tensor operations in the second stage. TSFC also efficiently traverse...