Efficient compilation of a class of variational forms
Journal article, 2007

We investigate the compilation of general multilinear variational forms over affines simplices and prove a representation theorem for the representation of the element tensor (element stiffness matrix) as the contraction of a constant reference tensor and a geometry tensor that accounts for geometry and variable coefficients. Based on this representation theorem, we design an algorithm for efficient pretabulation of the reference tensor. The new algorithm has been implemented in the FEniCS Form Compiler (FFC) and improves on a previous loop-based implementation by several orders of magnitude, thus shortening compile-times and development cycles for users of FFC. © 2007 ACM.

Monomials

Loop hoisting

Automation

BLAS

Compiler

Granularity

Finite element

Variational form

Author

R.C. Kirby

Anders Logg

Chalmers, Mathematical Sciences, Mathematics

University of Gothenburg

ACM Transactions on Mathematical Software

0098-3500 (ISSN)

Vol. 33 3

Subject Categories

Mathematics

Computational Mathematics

DOI

10.1145/1268769.1268771

More information

Created

10/8/2017